✦ LIBER ✦

Randomized Algorithms for 3-SAT

✍ Scribed by Thomas Hofmeister; Uwe Schoning; Rainer Schuler; Osamu Watanabe

Book ID: 105914843
Publisher: Springer
Year: 2006
Tongue: English
Weight: 228 KB
Volume: 40
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-005-1275-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Randomized Algorithm for 3-SAT

✍ Subhas Kumar Ghosh; Janardan Misra 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 257 KB

A Better Algorithm for Random k -SAT

✍ Coja-Oghlan, Amin 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 499 KB

Techniques from combinatorial approximat

Techniques from combinatorial approximation algorithms yield efficient algorithms for random -SAT

✍ Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 511 KB

Exact Algorithms for MAX-SAT

✍ Hantao Zhang; Haiou Shen; Felip Manyà 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 777 KB

The maximum satisfiability problem (MAX-SAT) is stated as follows: Given a boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Nied

Improved Approximation Algorithms for MA

Improved Approximation Algorithms for MAX SAT

✍ Takao Asano; David P. Williamson 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 215 KB

MAX SAT (the maximum s~tisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approxima~ tion algorithms for MAX SAT proposed by Goemans and Williamson and pze

Random 3-SAT: The Plot Thickens

✍ Cristian Coarfa; Demetrios D. Demopoulos; Alfonso San Miguel Aguirre; Devika Sub 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 527 KB