✦ LIBER ✦

A note on SAT algorithms and proof complexity

✍ Scribed by Jan Krajíček

Book ID: 113663353
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 133 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.03.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Sat and Upper Bounds on T

Algorithms for Sat and Upper Bounds on Their Complexity

✍ M. A. Vsemirnov; E. A. Hirsch; E. Ya. Dantsin; S. V. Ivanov 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 264 KB

Complexity analysis of the SAT engine: D

Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms

✍ Masami Hagiya; John A. Rose; Ken Komiya; Kensaku Sakamoto 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Taking advantage of the power of DNA molecules to spontaneously form hairpin structures, Sakamoto et al. designed a molecular algorithm to solve instances of the satisÿability problem on Boolean expressions in clausal form (the SAT problem), and by developing new experimental techniques for molecula

A note on propositional proof complexity

A note on propositional proof complexity of some Ramsey-type statements

✍ Jan Krajíček 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 184 KB

NOTE ON A STUDENT'S PROOF

✍ Ray Jurgensen 📂 Article 📅 1951 🏛 School Science and Mathematics Association 🌐 English ⚖ 39 KB

A note on religious proofs

✍ James E. Tomberlin 📂 Article 📅 1970 🏛 Springer Netherlands 🌐 English ⚖ 111 KB

A note on the complexity of a partition

A note on the complexity of a partition algorithm

✍ Vladimir Lifschitz; Leon Pesotchinsky 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 260 KB