BOOK-CHAPTER
Approximating MIN k-SAT
Year: 2002 Lecture notes in computer science Pages: 465-475 Publisher: Springer Science+Business Media
Keywords:
Approximation algorithm Minimax approximation algorithm Hardness of approximation Computer science Approximation theory Spouge's approximation Approximation error Function approximation Algorithm Mathematical optimization Mathematics Artificial intelligence Artificial neural network Mathematical analysis
Metrics
15
Cited By
0.70
FWCI (Field Weighted Citation Impact)
27
Refs
0.69
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
Optimization and Packing Problems
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Approximating Max NAE-k-SAT by anonymous local search
Aiyong XianKaiyuan ZhuDaming ZhuLianrong PuHong Liu
Journal: Theoretical Computer Science Year: 2016 Vol: 657 Pages: 54-63
BOOK-CHAPTER
The Complexity of Making Unique Choices: Approximating 1-in-k SAT
Venkatesan GuruswamiLuca Trevisan
Lecture notes in computer science Year: 2005 Pages: 99-110
JOURNAL ARTICLE
Approximating MIN 2-SAT and MIN 3-SAT
Journal: Theory of Computing Systems Year: 2005 Vol: 38 (3)Pages: 329-345
BOOK-CHAPTER
Approximating Highly Satisfiable Random 2-SAT
Lecture notes in computer science Year: 2014 Pages: 384-398