The Maple handbook (Maple V release 3)
The Maple handbook (Maple V release 3)
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Bounding the unsatisfiability threshold of random 3-SAT
Random Structures & Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Asymptotic Order of the Random k -SAT Threshold
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Random MAX SAT, random MAX CUT, and their phase transitions
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Limit theorems for random MAX-2-XORSAT
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the relative merits of simple local search methods for the MAX-SAT problem
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Bounds on threshold of regular random k-SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Say that a k-CNF a formula is p-satisfiable if there exists a truth assignment satisfying a fraction 1 − 2−k +p 2−k of its clauses (note that every k-CNF formula is 0-satisfiable). Let Fk(n, m) denote a random k-CNF formula on n variables with m clauses. For every k≥2 and every r0 we determine p and δ=δ(k)=O(k2−k/2) such that with probability tending to 1 as n→∞, a random k-CNF formula Fk(n, rn) is p-satisfiable but not (p+δ)-satisfiable.