The following pages link to (Q3002778):
Displaying 9 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)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Note on strong refutation algorithms for random \(k\)-SAT formulas (Q2840534) (← links)
- A spectral technique for random satisfiable 3CNF formulas (Q3514702) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034) (← links)
- Automata, Languages and Programming (Q5466490) (← links)
- Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) (Q6140986) (← links)
