✦ LIBER ✦

Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

✍ Scribed by John Franco

Book ID: 108112540
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 461 KB
Volume: 153
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.05.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 1203 || The algorithmic complexity of chemical threshold testing

✍ Bongiovanni, Giancarlo; Bovet, Daniel Pierre; Battista, Giuseppe 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 806 KB

2+p-SAT: Relation of typical-case comple

2+p-SAT: Relation of typical-case complexity to the nature of the phase transition

✍ Rémi Monasson; Riccardo Zecchina; Scott Kirkpatrick; Bart Selman; Lidror Troyans 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB

Heuristic methods for solution of problems in the NP-complete class of decision problems often reach exact solutions, but fail badly at ''phase boundaries,'' across which the decision to be reached changes from almost always having one value to almost always having a different value. We report an an

Identifying critical nodes in undirected

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

✍ Addis, Bernardetta; Di Summa, Marco; Grosso, Andrea 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Complexity of Regular Language Matching

Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms

✍ Sebastian Bala 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 328 KB

Worst-Case Complexity Bounds on Algorith

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations

✍ Iliopoulos, Costas S. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 772 KB

An efficient algorithm for the transitiv

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

✍ Brigitte Jaumard; Michel Minoux 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 516 KB