The following pages link to (Q4708577):
Displaying 10 items.
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- The structure of the set of satisfying assignments for a random \(k\)-CNF (Q2519391) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- Algorithms and Computation (Q5712137) (← links)
- Geometric properties of satisfying assignments of random ε-1-in-<i>k</i>SAT (Q5850753) (← links)
- Fundamentals of Computation Theory (Q5900782) (← links)
