The following pages link to (Q2762790):
Displaying 13 items.
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for<i>K</i>-SAT at large clause-to-variable ratios (Q3425245) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- (Q4708577) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Spectral techniques applied to sparse random graphs (Q5318249) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
