✦ LIBER ✦

Complete problems for space bounded subclasses of NP

✍ Scribed by Moon Jung Chung; W. Michael Evangelist; Ivan Hal Sudborough

Book ID: 104706079
Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 861 KB
Volume: 22
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On space-efficient algorithms for certai

On space-efficient algorithms for certain NP-complete problems

✍ A. Ferreira 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Complete problems for monotone NP

✍ Iain A. Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 768 KB

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

Node-Deletion NP-Complete Problems

✍ Krishnamoorthy, M. S.; Deo, Narsingh 📂 Article 📅 1979 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 854 KB

NP-Complete decision problems for binary

NP-Complete decision problems for binary quadratics

✍ Kenneth L. Manders; Leonard Adleman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 895 KB

Reliable identification of bounded-lengt

Reliable identification of bounded-length viruses is NP-complete

✍ Spinellis, D. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 251 KB