Approximation algorithm for random MAX-kSAT

DOI10.1007/11527695_14MaRDI QIDQ5714749zbMATH OpenOpenAlexFDO

Authors Yannet Interian

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1258327
• scientific article; zbMATH DE number 1552232
• Approximating Max kCSP using random restrictions
• scientific article; zbMATH DE number 1002206
• Approximation algorithms for the maximum satisfiability problem
• scientific article; zbMATH DE number 1302170
• On Some Recent Approximation Algorithms for MAX SAT
• An efficient approach to solving random \(k\)-SAT problems
• 1.0957-Approximation Algorithm for Random MAX-3SAT

Cited in

(7)

• Bounds on greedy algorithms for MAX SAT
• Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structures
• Size, cost and capacity: a semantic technique for hard random QBFs
• Backdoors to normality for disjunctive logic programs
• Randomized greedy: new variants of some classic approximation algorithms
• Approximating MAX kCSP -- outperforming a random assignment with almost a linear factor
• Witnesses for Answer Sets of Logic Programs

This page was built for publication: Approximation algorithm for random MAX-\(k\)SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714749)