The following pages link to André Lanka (Q706612):
Displaying 9 items.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- The spectral gap of random graphs with given expected degrees (Q2380304) (← links)
- Finding Planted Partitions in Random Graphs with General Degree Distributions (Q3058526) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- The Spectral Gap of Random Graphs with Given Expected Degrees (Q3613745) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034) (← links)
- Algorithms and Computation (Q5712137) (← links)
- Fundamentals of Computation Theory (Q5900782) (← links)
