Advertisement

The Mathematical Intelligencer

, Volume 33, Issue 4, pp 5–17 | Cite as

Minesweeper May Not Be NP-Complete but Is Hard Nonetheless

  • Allan ScottEmail author
  • Ulrike Stege
  • Iris van Rooij
Article

Keywords

Polynomial Time Mathematical Intelligencer Conjunctive Normal Form Truth Assignment Boolean Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada
  2. 2.Donders Institute for Brain, Cognition, and BehaviorRadboud University NijmegenNijmegenThe Netherlands

Personalised recommendations