Pages that link to "Item:Q3439113"
From MaRDI portal
The following pages link to Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113):
Displaying 4 items.
- 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)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)