The following pages link to Eli Ben-Sasson (Q496302):
Displaying 50 items.
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Near optimal seperation of tree-like and general resolution (Q558312) (← links)
- Random CNF's are hard for the polynomial calculus (Q626686) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Hard examples for the bounded depth Frege proof system (Q1430570) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Zero knowledge protocols from succinct constraint detection (Q1690269) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Aurora: transparent succinct arguments for R1CS (Q2292641) (← links)
- Scalable zero knowledge with no trusted setup (Q2304940) (← links)
- On Public Key Encryption from Noisy Codewords (Q2798809) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Short proofs are narrow—resolution made simple (Q2819584) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (Q2849388) (← links)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542) (← links)
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (Q2914294) (← links)
- Lower bounds for bounded depth Frege proofs via Pudlák-Buss games (Q2946607) (← links)
- Subspace Polynomials and Cyclic Subspace Codes (Q2976951) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- (Q3002812) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Affine Dispersers from Subspace Polynomials (Q3143296) (← links)
- Space Complexity in Propositional Calculus (Q3149864) (← links)
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic (Q3167412) (← links)
- Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity (Q3177809) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- (Q3191591) (← links)
- Space complexity in propositional calculus (Q3192004) (← links)
- From Affine to Two-Source Extractors via Approximate Duality (Q3451757) (← links)
- Tensor Products of Weakly Smooth Codes Are Robust (Q3541803) (← links)
- Size space tradeoffs for resolution (Q3579186) (← links)
- Hard examples for bounded depth frege (Q3579189) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Some 3CNF properties are hard to test (Q3581273) (← links)
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (Q3581280) (← links)
- Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
- Low Rate Is Insufficient for Local Testability (Q3588425) (← links)
- Short PCPs with Polylog Query Complexity (Q3624377) (← links)
- Composition of Semi-LTCs by Two-Wise Tensor Products (Q3638892) (← links)
- Size-Space Tradeoffs for Resolution (Q3654387) (← links)
- Short proofs are narrow—resolution made simple (Q4406287) (← links)
- Space complexity of random formulae in resolution (Q4417005) (← links)
- Pseudorandom Generators in Propositional Proof Complexity (Q4651526) (← links)
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (Q4930576) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes (Q4976034) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
