๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

NP-Complete decision problems for binary quadratics

โœ Scribed by Kenneth L. Manders; Leonard Adleman

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
895 KB
Volume
16
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complete problems for monotone NP
Complete problems for monotone NP
โœ Iain A. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 768 KB
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

The k-SATISFIABILITY problem remains NP-
The k-SATISFIABILITY problem remains NP-complete for dense families
โœ Ingo Schiermeyer ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

We consider the ~ATISFIABILITY problem (~-SAT): Given a family F of n clauses cl, .\_, , c, in conjunctive normal form, each consisting of k literals corresponding to k different variables of a set of r 2 k 2 1 boolean variables, is F satisfiable? By k-SAT@ no) we denote the k-SAT problem restricted