Journal ArticleDOI
A linear-time algorithm for testing the truth of certain quantified boolean formulas☆
Reads0
Chats0
TLDR
A simple constructive algorithm for the evaluation of formulas having two literals per clause, which runs in linear time on a random access machine.About:
This article is published in Information Processing Letters.The article was published on 1979-03-15. It has received 970 citations till now. The article focuses on the topics: 2-satisfiability & Conjunctive normal form.read more
Citations
More filters
Book
The Algorithm Design Manual
TL;DR: This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency.
Journal ArticleDOI
Analytic and Algorithmic Solution of Random Satisfiability Problems
TL;DR: A class of optimization algorithms that can deal with the proliferation of metastable states are introduced; one such algorithm has been tested successfully on the largest existing benchmark of K-satisfiability.
Journal ArticleDOI
Determining computational complexity from characteristic 'phase transitions.'
TL;DR: An analytic solution and experimental investigation of the phase transition in K -satisfiability, an archetypal NP-complete problem, is reported and the nature of these transitions may explain the differing computational costs, and suggests directions for improving the efficiency of search algorithms.
Journal ArticleDOI
Test pattern generation using Boolean satisfiability
TL;DR: The author describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational circuits, which allows for the addition of heuristics used by structural search methods, and has produced excellent results on popular test pattern generation benchmarks.
Book
Handbook of Satisfiability
TL;DR: A collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Journal ArticleDOI
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Proceedings ArticleDOI
The complexity of satisfiability problems
TL;DR: An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Journal ArticleDOI
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even,Alon Itai,Adi Shamir +2 more
TL;DR: A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems areNP-complete.