✦ LIBER ✦

On the probabilistic performance of algorithms for the satisfiability problem

✍ Scribed by John Franco

Book ID: 113162876
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 278 KB
Volume: 23
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90051-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic bounds and algorithms for

Probabilistic bounds and algorithms for the maximum satisfiability problem

✍ Endre Boros; András Prékopa 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 879 KB

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Mixed-integer column generation algorith

Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem

✍ Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Araga˜o 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 950 KB

The column generation approach to large-scale linear programming is extended to the mixed-integer case. Two general algorithms, a dual and a primal one, are presented. Both involve finding k-best solutions to combinatorial optimization subproblems. Algorithms for these subproblems must be tailored t

The Satisfiability Problem for Probabili

The Satisfiability Problem for Probabilistic Ordered Branching Programs

✍ M. Agrawal; T. Thierauf 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 246 KB

Probabilistic analysis of the pure liter

Probabilistic analysis of the pure literal heuristic for the satisfiability problem

✍ John Franco 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 547 KB

Probabilistic analysis of the Davis Putn

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

✍ John Franco; Marvin Paull 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 624 KB