✦ LIBER ✦

New Worst-Case Upper Bounds for SAT

✍ Scribed by Edward A. Hirsch

Book ID: 110234431
Publisher: Springer Netherlands
Year: 2000
Tongue: English
Weight: 153 KB
Volume: 24
Category: Article
ISSN: 0168-7433
DOI: 10.1023/a:1006340920104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for (n, 3)-MAX-SAT

✍ I. A. Bliznets 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 235 KB

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

Worst Case Bounds for Maximal Compatible

Worst Case Bounds for Maximal Compatible Subsets

✍ Rubin, F. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 339 KB

Worst Case Bounds for Shortest Path Inte

Worst Case Bounds for Shortest Path Interval Routing

✍ Cyril Gavoille; Eric Guévremont 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Consider shortest path inter¨al routing, a popular memory-balanced method for Ž . solving the routing problem on arbitrary networks. Given a network G, let IRS G denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval ro

Worst case bounds for the Euclidean matc

Worst case bounds for the Euclidean matching problem

✍ David Avis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 424 KB

R0 bounds for worst-case endemic mixing

R0 bounds for worst-case endemic mixing models

✍ Edward H. Kaplan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 98 KB