Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ben-Sasson, Eli - Department of Computer Science, Technion, Israel Institute of Technology
Random CNF's are Hard for the Polynomial Calculus Eli BenSasson
Finding a Randomly Planted Assignment in a Random 3-CNF Eli Ben-Sasson Yonatan Bilu y Danny Gutfreund z
Short Proofs are Narrow { Resolution made Simple
Lower Bounds for Bounded Depth Frege Proofs via Buss-Pudl ak Games
SIAM J. COMPUT. c # 2006 Society for Industrial and Applied Mathematics
Subspace Polynomials and List Decoding of Reed-Solomon Codes Eli Ben-Sasson
Expansion in Proof Complexity
An Approach to Bounded Rationality Eli Ben-Sasson
Space Complexity of Random Formulae in Eli Ben-Sasson
Short PCPs Verifiable in Polylogarithmic Time # Eli BenSasson + Oded Goldreich # Prahladh Harsha Madhu Sudan
A Gap in Average Proof Complexity Eli BenSasson Yonatan Bilu y
Some 3CNF Properties are Hard to Test Eli BenSasson
Short PCPs Verifiable in Polylogarithmic Time Eli Ben-Sasson
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
Bounds on 2-Query Codeword Testing Eli Ben-Sasson Oded Goldreich y Madhu Sudan z
Near Optimal separation of Tree-like and General Resolution
Hard Examples for Bounded Depth Frege Eli Ben-Sasson
Technion IIT Department of Computer Science
Robust Locally Testable Codes and Products of Codes Eli BenSasson # Madhu Sudan +
Sound 3-query PCPPs are Long Eli Ben-Sasson
