default search action
"The Sudoku completion problem with rectangular hole pattern is NP-complete."
Ramón Béjar et al. (2012)
- Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls:
The Sudoku completion problem with rectangular hole pattern is NP-complete. Discret. Math. 312(22): 3306-3315 (2012)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.