The following pages link to (Q4449176):
Displaying 4 items.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- Random MAX SAT, random MAX CUT, and their phase transitions (Q4739584) (← links)
- Spectral techniques applied to sparse random graphs (Q5318249) (← links)
