JOURNAL ARTICLE

Approximating MIN 2-SAT and MIN 3-SAT

Adi AvidorUri Zwick

Year: 2005 Journal:   Theory of Computing Systems Vol: 38 (3)Pages: 329-345   Publisher: Springer Science+Business Media
Keywords:
Approximation algorithm Hardness of approximation Minimax approximation algorithm Mathematics Spouge's approximation Approximation theory Maximum satisfiability problem Approximation error Combinatorics Algorithm Mathematical optimization Boolean function Mathematical analysis

Metrics

27
Cited By
1.40
FWCI (Field Weighted Citation Impact)
26
Refs
0.79
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Optimization and Packing Problems
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering

Related Documents

BOOK-CHAPTER

Approximating Highly Satisfiable Random 2-SAT

Andreĭ A. BulatovCong Wang

Lecture notes in computer science Year: 2014 Pages: 384-398
BOOK-CHAPTER

Approximating MIN k-SAT

Adi AvidorUri Zwick

Lecture notes in computer science Year: 2002 Pages: 465-475
BOOK-CHAPTER

Counting Satisfying Assignments in 2-SAT and 3-SAT

Vilhelm DahllöfPeter JönssonMagnus Wahlström

Lecture notes in computer science Year: 2002 Pages: 535-543
© 2026 ScienceGate Book Chapters — All rights reserved.