𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Contractibility and NP-completeness

✍ Scribed by A. E. Brouwer; H. J. Veldman

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
344 KB
Volume
11
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Separating NP-Completeness Notions under
Separating NP-Completeness Notions under Strong Hypotheses
✍ Klaus Ambos-Spies; Levke Bentzien πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 227 KB

Lutz (1993, ``Proceedings of the Eight Annual Conference on Structure in Complexity Theory, '' pp. 158 175) proposed the study of the structure of the class NP=NTIME( poly) under the hypothesis that NP does not have p-measure 0 (with respect to Lutz's resource bounded measure (1992, J. Comput. Syste

Contractive Completions of Hankel Partia
Contractive Completions of Hankel Partial Contractions
✍ RaΓΊl Curto; Carlos HernΓ‘ndez; Elena de Oteyza πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 380 KB

Hankel partial contraction is a Hankel matrix such that not all of its entries are determined, but in which every well-defined submatrix is a contraction. We address the problem of whether a Hankel partial contraction in which the upper left triangle is known can be completed to a contraction. It is

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

Average degree and contractibility
Average degree and contractibility
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

It is proved that for every number k there exists a number f (k) such that every finite k-connected graph of average degree exceeding f (k) contains an edge whose contraction yields again a k-connected graph. For the proof, tree orders on certain sets of smallest separating sets of the graph in ques