3

Answers
votes newest views recent
-5
Do there exist chess positions that require exponentially many moves to reach?
-3
Is this a well known NP-complete problem?
1
A polynomial-time algorithm for deciding whether a language has a polynomial time algorithm