Small PCPs with low query complexity
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Main Author: | Harsha, Prahladh, 1976- |
---|---|
Other Authors: | Madhu Sudan. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/86448 |
Similar Items
-
Robust PCPs of proximity and shorter PCPs
by: Harsha, Prahladh, 1976-
Published: (2005) -
Imperfect gaps in Gap-ETH and PCPs
by: Vyas, Nikhil(Electrical engineer and computer scientist)Massachusetts Institute of Technology.
Published: (2019) -
PCPs for Arthur-Merlin games and communication protocols
by: Drucker, Andrew Donald
Published: (2010) -
Quantum speedups in query complexity
by: Ben David, Shalev
Published: (2018) -
Quantum query complexity revisited
by: Preda, Daniel C. (Daniel Ciprian), 1979-
Published: (2006)