Fillmat is NP-Complete and ASP-Complete
Authors:
- 1 January 2015
- journal article
- Published by Information Processing Society of Japan in Journal of Information Processing
- Vol. 23 (3) , 310-316
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Computational Complexity and an Integer Programming Model of ShakashakaIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014
- Yosenabe is NP-completeJournal of Information Processing, 2014
- Kurodoko is NP-CompleteJournal of Information Processing, 2012
- Hashiwokakero is NP-completeInformation Processing Letters, 2009
- Games, Puzzles, and Computation2009