Sciweavers

ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
13 years 9 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka