✦ LIBER ✦

Efficient data structures for backtrack search SAT solvers

✍ Scribed by Inês Lynce; João Marques-Silva

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Data Structures for Backtrack

✍ Inês Lynce; João Marques-Silva 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 267 KB

An efficient solver for weighted Max-SAT

✍ Teresa Alsinet; Felip Manyà; Jordi Planes 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 505 KB

Efficient worst-case data structures for

✍ J. L. Bentley; H. A. Maurer 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 689 KB

Cache efficient data structures and algo

✍ Judith Hartmann; Andreas Krahnke; Christoph Zenger 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Efficient similarity search for market b

✍ Alexandros Nanopoulos; Yannis Manolopoulos 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 208 KB

Implicit data structures for fast search

✍ J.Ian Munro; Hendra Suwanda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 883 KB