The Sudoku completion problem with rectangular hole pattern is NP-complete.
Ramón BéjarCèsar FernándezCarles MateuMagda VallsPublished in: Discret. Math. (2012)
Keyphrases
- np complete
- pattern matching
- np hard
- randomly generated
- constraint satisfaction problems
- computational complexity
- conjunctive queries
- satisfiability problem
- np complete problems
- pspace complete
- associative memory
- search algorithm
- parallel search
- computationally complex
- data complexity
- pattern languages
- pattern discovery
- scheduling problem
- polynomially solvable
- polynomial time complexity