Complexity and Completeness of Finding Another Solution and Its Application to Puzzles

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 5, 2003, Pages 1052-1060

  Yato, Takayuki ^a   Seta, Takahiro ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Another solution; Computational complexity; NP complete; Puzzle

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

PUZZLES;

COMPUTATIONAL COMPLEXITY;

EID: 0141903396     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis, "Algorithms for drawing graphs: An annotated bibliography," Computational Geometry, vol.4, no.5, pp.235-284, 1994.
2. C.J. Colbourn, M.J. Colbourn, and D.R. Stinson, "The computational complexity of recognizing critical sets," Graph Theory, Singapore 1983, Lecture Notes in Math., no. 1073, pp.248-253, Springer, 1984.
3. E.D. Demaine, "Playing games with algorithms: Algorithmic combinatorial game theory," Computing Research Repository, arXiv:cs.CC/0106009, 2002. (available at http://arXiv.org/).
4. M.R. Garey, D.S. Johnson, and R.E. Tarjan, "The planar Hamiltonian circuit problem is NP-complete," SIAM J. Computing, vol.5, no.4, pp.704-714, 1976.
5. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
6. N. Ueda and T. Nagao, "NP-completeness results for NONO-GRAM via parsimonious reductions," Technical Report, TR96-0008, Department of Computer Science, Tokyo Institute of Technology, 1996.