Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Kindler, Guy - School of Computer Science and Engineering, Hebrew University of Jerusalem
An Improved Lower Bound for Approximating CVP I. Dinur \Lambda G. Kindler \Lambda R. Raz y S. Safra \Lambda
Understanding Parallel Repetition Requires Understanding Foams Uriel Feige
On the Error Parameter of Dispersers Ronen Gradwohl # Guy Kindler + Omer Reingold # Amnon TaShma
Hardness of Approximating the Closest Vector Problem with PreProcessing Mikhail Alekhnovich # Subhash A. Khot + Guy Kindler # Nisheeth K. Vishnoi
On Non-Approximability for Quadratic Programs Sanjeev Arora
PCP Characterizations of NP: Towards a Polynomially-Small
On NonApproximability for Quadratic Programs Sanjeev Arora #
Lower Bounds for the Noisy Broadcast Problem Navin Goyal
Hardness of Approximating the Closest Vector Problem with Pre-Processing Mikhail Alekhnovich
On Distributions Computable by Random Walks on Graphs # Guy Kindler + Dan Romik #
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
Tel Aviv University Raymond and Beverly Sackler
Optimal Inapproximability Results for MAXCUT and Other 2Variable CSPs?
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors
Lower Bounds for the Noisy Broadcast Problem Navin Goyal #
The UGC hardness threshold of the p Grothendieck problem Guy Kindler
Eliminating cycles in the discrete torus B ela Bollob as
Eliminating cycles in the discrete torus Bela Bollobas
