Pages that link to "Item:Q5900782"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900782):
Displaying 4 items.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)
- Spectral techniques applied to sparse random graphs (Q5318249) (← links)