Back to Results
First PageMeta Content
Applied mathematics / NP-complete / P versus NP problem / EXPTIME / PSPACE-complete / NP / P-complete / P / Reduction / Theoretical computer science / Computational complexity theory / Complexity classes


COMPLEXITY AND COMPLETENESS OF FINDING ANOTHER SOLUTION AND ITS APPLICATION TO PUZZLES
Add to Reading List

Document Date: 2003-05-03 02:38:34

Open Document

File Size: 345,08 KB

Share Result on Facebook

Company

3SAT / Imai Laboratory / /

Country

Japan / /

Facility

Science The University of Tokyo / /

IndustryTerm

deterministic algorithms / /

Organization

University of Tokyo / Graduate School / /

Person

Takahiro Seta / Cross Sum (Kakkuro) / Papadimitriou / Hiroshi Imai / Tsuyoshi Ito / /

Position

supervisor / co-author / player / Information Science Thesis Supervisor / Professor of Information Science ABSTRACT The / /

SocialTag