Theses most similar to those of author Harsha, Prahladh, 1976-
Robust PCPs of proximity and shorter PCPs (2004) read it
- Advisor: Albert Meyer
- Department of Mathematics
- Advisor: Michael Sipser
- Department of Mathematics
- Advisor: Michael F. Sipser
- Department of Mathematics
- Advisor: Madhu Sudan
- Department of Mathematics
- Advisor: Ran Canetti
- Department of Mathematics
- Advisor: Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
Polynomial identity testing of read-once oblivious algebraic branching programs
Forbes, Michael Andrew (2014)
- Advisors: Amir Shpilka; Scott Aaronson
- Department of Electrical Engineering and Computer Science
- Advisor: Vinod Vaikuntanathan
- Department of Electrical Engineering and Computer Science
Lower bounds on the classical simulation of quantum circuits for quantum supremacy
Dalzell, Alexander M (2017)
- Advisor: Aram W. Harrow
- Department of Physics
- Advisor: Scott Aaronson
- Department of Electrical Engineering and Computer Science
Small PCPs with low query complexity (2000) read it
- Advisor: Michael Sipser
- Department of Mathematics
- Advisor: Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
- Advisor: Ronitt Rubinfeld
- Department of Mathematics
- Advisor: Scott Aaronson
- Department of Electrical Engineering and Computer Science
- Advisor: Ronitt Rubinfeld
- Department of Electrical Engineering and Computer Science
Query-efficient checking of proofs and improved PCP characterizations of NP
Guruswami, Venkatesan, 1976- (1999)
- Advisor: Madhu Sudan
- Department of Electrical Engineering and Computer Science
- Advisor: Shafi Goldwasser
- Department of Electrical Engineering and Computer Science
- Advisor: Silvio Micali
- Department of Electrical Engineering and Computer Science
- Advisor: Madhu Sudan
- Department of Electrical Engineering and Computer Science
- Advisor: Scott Aaronson
- Department of Electrical Engineering and Computer Science