Open AccessBook
Algorithms for the Satisfiability Problem
Jun Gu,Paul Walton Purdom,John Franco,Benjamin W. Wah +3 more
- 31 Dec 2018
TL;DR: An instance of the satisfiability (SAT) problem is a Boolean formula that has three components: A set of n variables, a set of literals, and a setOf literals combined by just logical or (V) connectives.
read more
Abstract: An instance of the satisfiability (SAT) problem is a Boolean formula that has three components [102, 191]:
A set of n variables: x 1, x 2, x n .
A set of literals. A literal is a variable (Q = x) or a negation of a variable \( \left( {Q = \bar x} \right)\).
A set of m distinct clauses: C 1, C 2, ..., C m. Each clause consists of only literals combined by just logical or (V) connectives.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A probabilistic algorithm for k-SAT and constraint satisfaction problems
T. Schoning
- 17 Oct 1999
TL;DR: This is the fastest (and also the simplest) algorithm for 3-SAT known up to date and turns out that any CSP can be solved with complexity at most (d/spl middot/(1-1/l)+/spl epsiv/)/sup n/.
A deterministic (2 - 2/( k + 1)) n algorithm for k -SAT based on local search
Evgeny Dantsin,Andreas Goerdt,Edward A. Hirsch,Ravi Kannan,Jon Kleinberg,Christos H. Papadimitriou,Prabhakar Raghavan,Uwe Schöning +7 more
TL;DR: A deterministic local search algorithm for k-SAT running in time (2-2/(k+ 1))n up to a polynomial factor is described, which is better than all previous bounds for deterministic k- SAT algorithms.
269
Applying Formal Methods to Networking: Theory, Techniques, and Applications
Junaid Qadir,Osman Hasan +1 more
TL;DR: This paper presents a self-contained tutorial of the formidable amount of work that has been done in formal methods and presents a survey of its applications to networking.
53
Efficient solution of Boolean satisfiability problems with digital memcomputing.
TL;DR: In this paper, a memory-assisted physical system (a digital memcomputing machine) is proposed to solve the SAT problem in continuous time, without the need to introduce chaos or an exponentially growing energy.
On optimal algorithms and optimal proof systems
Jochen Messner
- 04 Mar 1999
TL;DR: It is shown that an optimal acceptor for a language L exists if there is a p-optimal proof system for L and the inverse implication holds, and the relationship of this notion of an 'optimal acceptor' to a more general notion of optimality is investigated.
28
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Artificial Intelligence: A Modern Approach
Stuart Russell,Peter Norvig +1 more
- 01 Jan 2020
TL;DR: In this article, the authors present a comprehensive introduction to the theory and practice of artificial intelligence for modern applications, including game playing, planning and acting, and reinforcement learning with neural networks.
21.4K