✳flâneur — a map of the web's best reading
Minesweeper is NP-complete.
academic.timwylie.com · 69 words · saved by 1 readers
N/A
# link_2bt73shfiap.pdf ## Metadata - PDFFormatVersion=1.2 - IsLinearized=true - IsAcroFormPresent=false - IsXFAPresent=false - IsCollectionPresent=false - IsSignaturesPresent=false - CreationDate=D:20020320152938 - ModDate=D:20020320152938 - Producer=AIS ImagePDF 1.06 - UNLICENSED - Evaluation Only - Creator=Relais Articlizer - Title=Minesweeper is NP-complete. - Subject=ImagePDF Sample PDF, TIFF to PDF, JPEG to PDF ## Contents ### Page 1 ### Page 2 ### Page 3 ### Page 4 ### Page 5 ### Page 6 ### Page 7
Explore this link on the map →saved by
related reading
- P versus NP problem - Wikipediaen.wikipedia.org
- NP-completeness - Wikipediaen.wikipedia.org
- Complexity class - Wikipediaen.wikipedia.org
- NP (complexity) - Wikipediaen.wikipedia.org
- Complexity Zoocomplexityzoo.net
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- Golang landmines · GitHubgist.github.com
- Why SAT Is Hardmatklad.github.io
- GitHub - konstin/sudoku-in-python-packaging: Sudoku solving in python packaging · GitHubgithub.com
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Word Search Makerthewordsearch.com
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog