𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On universally easy classes for NP-complete problems

✍ Scribed by Erik D. Demaine; Alejandro López-Ortiz; J.Ian Munro

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
187 KB
Volume
304
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neural networks for NP-complete problems
Neural networks for NP-complete problems
✍ Marco Budinich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 547 KB

combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound ma

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