Theses most similar to Small PCPs with low query complexity (Harsha, Prahladh, 1976-; 2000) read it

Efficient holographic proofs

Russell, Alexander Craig (1996)

  • Advisor: Michael Sipser
  • Department of Mathematics
Read it

Property testing for distributions on partially ordered sets

Biswal, Punyashloka (2007)

  • Advisor: Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

Testing and learning Boolean functions

Matulef, Kevin Michael (2009)

  • Advisor: Ronitt Rubinfeld
  • Department of Mathematics
Read it

Tensor rank : some lower and upper bounds

Forbes, Michael Andrew (2011)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it

Testability of linear-invariant properties

Bhattacharyya, Arnab (2011)

  • Advisor: Ronitt Rubinfeld
  • Department of Electrical Engineering and Computer Science
Read it

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
Read it

Frontiers in zero knowledge

Sahai, Amit, 1974- (2000)

  • Advisor: Shafi Goldwasser
  • Department of Electrical Engineering and Computer Science
Read it

Succinct non-Interactive arguments

Chiesa, Alessandro (2014)

  • Advisor: Silvio Micali
  • Department of Electrical Engineering and Computer Science
Read it

LP/SDP hierarchy lower bounds for decoding random LDPC codes

Ghazi, Badih (2015)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

PCPs for Arthur-Merlin games and communication protocols

Drucker, Andrew Donald (2010)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it