Tetravex is NP-complete

Information Processing Letters

Volumn 99, Issue 5, 2006, Pages 171-174

  Takenaga, Yasuhiko ^a   Walsh, Toby ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b CSIRO   (Australia)

Author keywords

Computational complexity; NP completeness; Tetravex

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MAPPING; PROBLEM SOLVING;

HORIZONTAL WIRING TILES; NP-COMPLETENESS; ONE PERSON COMPUTER GAME; TETRAVEX;

THEOREM PROVING;

EID: 33745646746     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.04.010     Document Type: Article

References (3)

1. E.D. Demaine, S. Hohenberger, D. Liben-Nowell, Tetris is hard, even to approximate, in: Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), 2003, pp. 351-363
2. Kral D., Majerech V., Sgall J., Tichy T., and Woeginger G. It is tough to be a plumber. Theoret. Comput. Sci. 313 3 (2004) 473-484
3. Ratner D., and Warmuth M. Finding a shortest solution for the (n × n)-extension of the 15-puzzle is intractable. J. Symbolic Comput. 10 2 (1990) 111-137