Cover of Minesweeper. Varianten und Komplexität by Yakovleva, Polina, ISBN 9783656541080
General

Minesweeper. Varianten und Komplexität

MINESWEEPER VARIANTEN UND KOMP

Contributor(s): Author Format: Paperback

Paperback · ISBN 9783656541080

₹4,138 2%
₹4,244

Inclusive of GST and other taxes

100% Quality Assurance
No Account Creation Required
Fast Delivery
Secured Transactions

Arriving at your doorstep in 10-15 days

Our logisitcs team will make sure everyitem is delivered safely

Key Specifications

ISBN 9783656541080
Subtitle MINESWEEPER VARIANTEN UND KOMP
Publisher GRIN Verlag
Publication date November 2013
Language English
MRP £32.90 GBP
Page count 60
Item weight 20 g

Before elaborating on the complexity of Minesweeper, the basic ideas of complexity theory and the rules of the game shall be introduced. Both subjects should be internalized in order to understand the contents of this bachelor thesis. The basics are learned from: Introduction to the Theory of Complexity by M. Sipser [20], H. Vollmer Skript zur Vorlesung Komplexit�t von Algorithmen [21] and S. Arora and B. Barak Computational Complexity: A Modern Approach [19]. Further, this bachelor thesis will be based upon the main results of these two papers: Minesweeper is NP complete by R. Kaye [1], Minesweeper May Not Be NP-Complete but Is Hard Nonetheless by A. Scott [2].