Pages that link to "Item:Q5470697"
From MaRDI portal
The following pages link to Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697):
Displaying 12 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← 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)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Approximating independent set in perturbed graphs (Q2446304) (← 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)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034) (← links)
- Fundamentals of Computation Theory (Q5900782) (← links)
