Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Sudoku completion problem with rectangular hole pattern is NP-complete."

Ramón Béjar et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2012.07.022

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/BejarFMV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BejarFMV12
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)

a service of

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.