𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NP-complete problems simplified on tree schemas

✍ Scribed by N. Goodman; O. Shmueli

Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
385 KB
Volume
20
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simplified NP-complete MAXSAT problem
A simplified NP-complete MAXSAT problem
✍ Venkatesh Raman; B. Ravikumar; S.Srinivasa Rao πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 639 KB

It is shown that the MAXZSAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears in at most three

On the np-completeness of certain networ
On the np-completeness of certain network testing problems
✍ S. Even; O. Goldreich; S. Moran; P. Tong πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ JiΕ™Γ­ Fiala πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

Taking It to the Limit: On Infinite Vari
Taking It to the Limit: On Infinite Variants of NP-Complete Problems
✍ Tirza Hirst; David Harel πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 673 KB

We define infinite, recursive versions of NP optimization problems. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The present paper was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, whil