|
ComputingReviews.com
|
Mutilated chessboard problem is exponentially hard for resolution Alekhnovich M. Theoretical Computer Science310(1-3):513-525,2004.Type:Article |
|
|
|
Published By: Elsevier Science Publishers Ltd. |
|
|
|
|
|
|
|
|
Use your personal or institutional subscription to read the fulltext of the article.
|
|
|
|
|
|
|
|
|
|
|
|