“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

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 …

Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

A concise and lucid exposition of the major topics in knowledge representation, from two of
the leading authorities in the field.-Stuart Russell, UC Berkeley The information is valuable …

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 …

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 …

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 …

We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding
satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm …

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 …

Local search has been applied successfully to a diverse collection of optimization problems.
It's appreciated for its basic conceptual foundation, its general applicability, and its power to …