CNF encodings
S Prestwich - Handbook of satisfiability, 2021 - ebooks.iospress.nl
Before a combinatorial problem can be solved by current SAT methods, it must usually be
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …
Exact exponential algorithms
Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
Exact algorithms for NP-hard problems: A survey
GJ Woeginger - … Optimization—Eureka, You Shrink! Papers Dedicated …, 2003 - Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known
results and approaches, we provide pointers to the literature, and we discuss several open …
results and approaches, we provide pointers to the literature, and we discuss several open …
[图书][B] Boolean functions: Theory, algorithms, and applications
Y Crama, PL Hammer - 2011 - books.google.com
Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …
unified presentation of the structural, algorithmic and applied aspects of the theory of …
[图书][B] Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
J Hromkovič - 2013 - books.google.com
Algorithmic design, especially for hard problems, is more essential for success in solving
them than any standard improvement of current computer tech nologies. Because of this, the …
them than any standard improvement of current computer tech nologies. Because of this, the …
An improved exponential-time algorithm for k-SAT
We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding
satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm …
satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm …
A measure & conquer approach for the analysis of exact algorithms
For more than 40 years, Branch & Reduce exponential-time backtracking algorithms have
been among the most common tools used for finding exact solutions of NP-hard problems …
been among the most common tools used for finding exact solutions of NP-hard problems …
[图书][B] Economics and computation
J Rothe - 2015 - Springer
1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …
supporting her as a junior professor for Computational Social Choice and by the project …
A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search
Local search is widely used for solving the propositional satisfiability problem. Papadimitriou
(1991) showed that randomized local search solves 2-SAT in polynomial time. Recently …
(1991) showed that randomized local search solves 2-SAT in polynomial time. Recently …
3-coloring in time O (1.3289 n)
R Beigel, D Eppstein - Journal of Algorithms, 2005 - Elsevier
We consider worst case time bounds for several NP-complete problems, based on a
constraint satisfaction (CSP) formulation of these problems:(a, b)-CSP instances consist of a …
constraint satisfaction (CSP) formulation of these problems:(a, b)-CSP instances consist of a …