• Corpus ID: 2211006

Computers and Intractability: A Guide to the Theory of NP-Completeness

  title={Computers and Intractability: A Guide to the Theory of NP-Completeness},
  author={M. R. Garey and David S. Johnson},
The color of freeze dried coffee can be darkened by carefully controlling the pressure in the drying chamber during the first 1 to 5 hours of the drying cycle. [] Key Result Thus, a high quality freeze dried coffee is obtained with a more desirable appearance.
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
The paper is concerned with the optimal compression of propositional Horn production rule bases-one of the most important knowledge bases used in practice and develops a procedure and algorithm for recognizing in quadratic time the quasi acyclicity of a function given by a Horn CNF.
Graph-based methods for Horn knowledge compression
  • P. Hammer, A. Kogan
  • Computer Science
    1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences
  • 1994
The paper is concerned with the optimal compression of propositional Horn production rule bases/spl minus/one of the most important knowledge bases used in practice and develops a procedure and algorithm for recognizing in quadratic time the quasi-acyclicity of a function given by a Horn CNF.
Reasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation
This chapter presents the kind of A.I. problems that can typically be addressed by the Propositional Logic, and presents an historical view of the impressive progresses observed in the practical solving of the Satisfiability (SAT) problem.
The complexity of minimum partial truth assignments and implication in negation-free formulae
It is argued that these results are relevant, first to areas where a least solution (in some fashion) is desired, and second, to limited deductive systems.
Horn minimization by iterative decomposition
A linear time algorithm is presented which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimized problem on a“shorter” CNF.
Applications of General Exact Satisfiability in Propositional Logic Modelling
It is shown that c-atoms can be efficiently reduced to a general form of Exact Satisfiability and the general x i sat problem, to find an assignment for a CNF such that exactly i literals are true in each clause for any i ≥ 1, is solvable in time O(1.4143 n).
Propositional satisfiability in declarative programming
This paper proposes two logics based on predicate calculus as formalisms for encoding search problems and shows that the expressive power of these logics is given by the class NP-search.
TR-2007008: The Satisfiability Problem—From the Theory of NP-Completeness to State-of-the-Art SAT Solvers
SAT is introduced through the theory of NP-completeness, and a broad overview of the different techniques and algorithms used to solve the SAT problem is followed, noting that given vast amount of algorithms that have been proposed only the classical and most prominent are discussed.


Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
  • J. Saxe
  • Mathematics
    SIAM J. Algebraic Discret. Methods
  • 1980
An algorithm to solve the problem of testing the bandwidth of a graph in time, which implies that the “Bandwidth $\overset{?}{\leqq} k$” problem is not NP-complete (unless P = NP) for any fixed k.
Two papers on graph embedding problems
Abstract : This report contains two independent papers on problems concerned with graph embedding-i.e., assignment of the vertices of a graph to points in a metric space subject to specified
Some theoretical aspects of position-location problems
  • Y. Yemini
  • Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
Among the major results presented is the discovery of a large class of geometrical decision problems, all of which are randomly decidable (i.e., decidable by a probabilistic polynomial-time algorithm), but many of which seem to be Intractable.
Area-Efficient Graph Layouts (for VLSI).
An algorithm is given that produces VLSI layouts for classes of graphs that have good separator theorems and shows in particular that any planar graph of n vertices has an O(n lg-square(n) area layout and that any tree of n Vertices can be laid out in linear area.
An application of graph coloring to printed circuit testing
Under certain assumptions on the possible types of short circuits, the structure of line-of-sight graphs is analyzed and it is shown that a well-known and efficient algorithm can be used to color them with a small number of colors.
Uniform Data Encodings
On the Area of Binary Tree Layouts
Tidy Drawings of Trees
Two naive tree drawers are surveyed, formalize aesthetics for tidy trees, and two algorithms which draw tidy trees are discussed, one of which may be shown to require the minimum possible paper width.
The node cost measure for embedding graphs on the planar grid (Extended Abstract)
This paper is primarily concerned with a third measure, total number of nodes, which can be modeled by allowing the insertion of nodes along edges of the graph and then insisting that the embedding may not bend edges.
Grammar and L forms: An introduction
  • D. Wood
  • Linguistics
    Lecture Notes in Computer Science
  • 1980
A comparison study of context-free grammar forms for EOL and ETOL forms and their applications in education, research and teaching.