Yakovleva, Polina Author
Biography not available.
Browse all FOLKLORE books
Browse all GARDENS books
Browse all GRAPHIC NOVELS books
Browse all HISTORY - MEDIEVAL books
Browse all HUMOUR books
Browse all Juvenile Fiction : Biographical - Other books
Browse all Juvenile Fiction : Historical - Other books
Browse all Juvenile Fiction : Legends, Myths, & Fables - Other books
Browse all Juvenile Fiction : People & Places - Other books
Browse all Juvenile Fiction : People & Places - United States - Other books
Browse all Juvenile Fiction : Religious - Other books
Browse all Juvenile Nonfiction : History - Other books
Browse all Juvenile Nonfiction : Mathematics - Advanced books
Browse all Juvenile Nonfiction : People & Places - Other books
Browse all Juvenile Nonfiction : People & Places - United States - Othe books
Browse all LITERARY STUDIES books
Browse all LONDON books
Browse all Medical : Nursing - Mental Health books
Browse all MIND books
Browse all MUSEOLOGY books
Browse all NON-CLASSIFIABLE books
Browse all NONLINEAR SCIENCE books
Browse all POPULAR SCIENCE books
Browse all RELIGIOUS STUDIES books
Browse all SPIRIT books
Browse all SPORT books
Browse all TRAVEL WRITING books
Out of Stock
MINESWEEPER VARIANTEN UND KOMP
Paperback · ISBN 9783656541080
Inclusive of GST and other taxes
Arriving at your doorstep in 10-15 days
Our logisitcs team will make sure everyitem is delivered safely
| 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].
Log in to write a review for this book.
No reviews yet. Be the first to share your opinion.
Biography not available.