1.9k citations
- University of ChicagoUS60 papers
- Microsoft (United States)US23 papers
- Carnegie Mellon UniversityUS20 papers
- Massachusetts Institute of TechnologyUS18 papers
- Google (United States)US16 papers
- Technion – Israel Institute of TechnologyIL16 papers
- University of California, BerkeleyUS16 papers
- Princeton UniversityUS12 papers
- The University of Texas at AustinUS12 papers
- Toyota Technological InstituteJP10 papers
- University of TorontoCA10 papers
- University of WashingtonUS10 papers
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
Algorithmic regularity for polynomials and applications
Arnab Bhattacharyya, Pooya Hatami, Madhur Tulsiani
In analogy with the regularity lemma of Szemerédi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) mod…
cs.CC2013★ 3 cited
A Characterization of Approximation Resistance
Subhash Khot, Madhur Tulsiani, Pratik Worah
A predicate f:{-1,1}^k -> {0,1} with ρ(f) = \frac{|f^{-1}(1)|}{2^k} is called {\it approximation resistant} if given a near-satisfiable instance of CSP(f), it is computationally ha…