The following pages link to Prahladh Harsha (Q210279):
Displaying 50 items.
- (Q2762515) (← links)
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (Q2875180) (← links)
- An invariance principle for polytopes (Q2875181) (← links)
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (Q2941514) (← links)
- Lower bounds for bounded depth Frege proofs via Pudlák-Buss games (Q2946607) (← links)
- (Q2955002) (← links)
- (Q2963906) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- (Q3191612) (← links)
- (Q3579444) (← links)
- Robust pcps of proximity, shorter pcps and applications to coding (Q3580954) (← links)
- Some 3CNF properties are hard to test (Q3581273) (← links)
- (Q4598278) (← links)
- (Q4601833) (← links)
- Robust Multiplication-Based Tests for Reed–Muller Codes (Q4611428) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- (Q4636465) (← links)
- (Q4636557) (← links)
- (Q4636564) (← links)
- (Q4636610) (← links)
- (Q4638090) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q4933379) (← links)
- The Communication Complexity of Correlation (Q4976061) (← links)
- (Q5009534) (← links)
- From Local to Robust Testing via Agreement Testing (Q5090403) (← links)
- (Q5090936) (← links)
- (Q5093398) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q5171197) (← links)
- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract] (Q5236315) (← links)
- List Decoding with Double Samplers (Q5236316) (← links)
- DISTRIBUTED PROCESSING IN AUTOMATA (Q5249019) (← links)
- An invariance principle for polytopes (Q5395697) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q5408773) (← links)
- Almost settling the hardness of noncommutative determinant (Q5419120) (← links)
- Some 3CNF Properties Are Hard to Test (Q5700567) (← links)
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- (Q5875460) (← links)
- Sound 3-Query PCPPs Are Long (Q5892181) (← links)
- Sound 3-Query PCPPs Are Long (Q5900244) (← links)
- Small PCPs with low query complexity (Q5946703) (← links)
- (Q6062153) (← links)
- On the probabilistic degree of OR over the reals (Q6074648) (← links)
- (Q6090914) (← links)
- (Q6126246) (← links)
- Explicit SoS lower bounds from high-dimensional expanders (Q6348872) (← links)
- Algorithmizing the Multiplicity Schwartz-Zippel Lemma (Q6383614) (← links)
- Rigid matrices from rectangular PCPs (Q6491304) (← links)
- Boolean functions on high-dimensional expanders (Q6504899) (← links)
