The following pages link to (Q3002778):
Displaying 3 items.
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
