✦ LIBER ✦

Algorithms for Sat and Upper Bounds on Their Complexity

✍ Scribed by M. A. Vsemirnov; E. A. Hirsch; E. Ya. Dantsin; S. V. Ivanov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on SAT algorithms and proof compl

✍ Jan Krajíček 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Some Lower and Upper Complexity Bounds f

✍ Baum, Ulrich; Clausen, Michael 📂 Article 📅 1991 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 821 KB

Upper bounds and exact algorithms for -d

✍ David Pisinger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds and algorithms for parallel

✍ Hajo Broersma; Matthew Johnson; Daniël Paulusma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Efficient branch-and-bound algorithms fo

✍ Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 509 KB

On lower bounds for the complexity of po

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB