Pages that link to "Item:Q2840534"
From MaRDI portal
The following pages link to Note on strong refutation algorithms for random \(k\)-SAT formulas (Q2840534):
Displaying 7 items.
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Strongly refuting random CSPs below the spectral threshold (Q4977966) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034) (← links)
- Automata, Languages and Programming (Q5466490) (← links)
- Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (Q6083522) (← links)
- (Q6084345) (← links)