𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On NP-Completeness for Linear Machines

✍ Scribed by Christine Gaßner

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
314 KB
Volume
13
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Testing Orientability for Matroids is NP
Testing Orientability for Matroids is NP-Complete
✍ Jürgen Richter-Gebert 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Matroids and oriented matroids are fundamental objects in combinatorial geometry. While matroids model the behavior of vector configurations over general fields, oriented matroids model the behavior of vector configurations over ordered fields. For every oriented matroid there is a corresponding und

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

NP-completeness of list coloring and pre
NP-completeness of list coloring and precoloring extension on the edges of planar graphs
✍ Dániel Marx 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper __k__‐edge‐coloring of the graph. In list edge coloring every edge has a list of admissible colors,

SOLUTION OF LARGE LINEAR SYSTEMS ON PIPE
SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES
✍ NIKOLAUS GEERS; ROLAND KLEES 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 575 KB

We developed a direct out-of-core solver for dense non-symmetric linear systems of 'arbitrary' size N;N. The algorithm fully employs the Basic Linear Algebra Subprograms (BLAS), and can therefore easily be adapted to different computer architectures by using the corresponding optimized routines. We