𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Guest Column: NP-complete problems and physical reality

✍ Scribed by Aaronson, Scott

Book ID
121749218
Publisher
Association for Computing Machinery
Year
2005
Weight
897 KB
Volume
36
Category
Article
ISSN
0163-5700

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Node-Deletion NP-Complete Problems
Node-Deletion NP-Complete Problems
✍ Krishnamoorthy, M. S.; Deo, Narsingh πŸ“‚ Article πŸ“… 1979 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 854 KB
Trahtenbrot-Zykov problem and NP-complet
Trahtenbrot-Zykov problem and NP-completeness
✍ Peter Bugata πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 419 KB

Bugata, P., Trahtenbrot-Zykov problem and NP-completeness, Discrete Mathematics 108 (1992) 253-259. Zykov [5] posed a problem now known as the Trahtenbrot-Zykov problem: Given a finite graph H, does there exist a non-empty graph G with all neighbourhoods of its vertices isomorphic to H? This problem

DNA Models and Algorithms for NP-Complet
DNA Models and Algorithms for NP-Complete Problems
✍ Eric Bach; Anne Condon; Elton Glaser; Celena Tanguay πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 488 KB

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this pape