18 citations · 33 across the 2 of their papers we have counts for
2 papers
math.CO2008★ 15 cited
New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition
Omer Reingold, Luca Trevisan, Madhur Tulsiani +1
Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may…
cs.CC2004★ 18 cited
Inapproximability of Combinatorial Optimization Problems
Luca Trevisan
We survey results on the hardness of approximating combinatorial optimization problems.