Pages that link to "Item:Q5313034"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034):
Displaying 10 items.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Note on strong refutation algorithms for random \(k\)-SAT formulas (Q2840534) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- A spectral technique for random satisfiable 3CNF formulas (Q3514702) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Strongly refuting random CSPs below the spectral threshold (Q4977966) (← links)
- Algorithms and Computation (Q5712137) (← links)
- (Q6084345) (← 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)