메뉴 건너뛰기




Volumn 2697, Issue , 2003, Pages 351-363

Tetris is hard, even to approximate

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 35248818685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_36     Document Type: Article
Times cited : (63)

References (14)
  • 4
    • 84974704990 scopus 로고    scopus 로고
    • Playing games with algorithms: Algorithmic combinatorial game theory
    • August cs.CC/0106019
    • E. D. Demaine. Playing games with algorithms: Algorithmic combinatorial game theory. In Proc. MFCS, pages 18-32, August 2001. cs.CC/0106019.
    • (2001) Proc. MFCS , pp. 18-32
    • Demaine, E.D.1
  • 6
    • 0001627504 scopus 로고
    • Complexity results for multiprocessor scheduling under resource constraints
    • M. R. Garey and D. S. Johnson. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput., 4:397-411, 1975.
    • (1975) SIAM J. Comput. , vol.4 , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2
  • 8
    • 0003160342 scopus 로고    scopus 로고
    • Minesweeper is NP-Complete
    • R. Kaye. Minesweeper is NP-Complete. Math. Intelligencer, 22(2):9-15, 2000.
    • (2000) Math. Intelligencer , vol.22 , Issue.2 , pp. 9-15
    • Kaye, R.1
  • 9
    • 7444234215 scopus 로고    scopus 로고
    • Tetris unplugged
    • July
    • S. Kim. Tetris unplugged. Games Magazine, pages 66-67, July 2002.
    • (2002) Games Magazine , pp. 66-67
    • Kim, S.1
  • 13
    • 35248814110 scopus 로고    scopus 로고
    • Tetris, Inc.
    • Tetris, Inc. http://www.tetris.com.
  • 14
    • 84968779685 scopus 로고    scopus 로고
    • Jenga
    • U. Zwick. Jenga. In Proc. SODA, pages 243-246, 2002.
    • (2002) Proc. SODA , pp. 243-246
    • Zwick, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.