10 citations · 16 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2006★ 10 cited
Random 3CNF formulas elude the Lovasz theta function
Uriel Feige, Eran Ofek
Let be a 3CNF formula with n variables and m clauses. A simple nonconstructive argument shows that when m is sufficiently large compared to n, most 3CNF formulas are not satisf…
cs.CC2003
Approximation thresholds for combinatorial optimization problems
Uriel Feige
An NP-hard combinatorial optimization problem is said to have an {\em approximation threshold} if there is some such that the optimal value of can be approximated in po…