The following pages link to (Q4535026):
Displayed 6 items.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story (Q3439112) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)