Small PCPs with low query complexity

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.

Bibliographic Details
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
_version_ 1826198355726827520
author Harsha, Prahladh, 1976-
author2 Madhu Sudan.
author_facet Madhu Sudan.
Harsha, Prahladh, 1976-
author_sort Harsha, Prahladh, 1976-
collection MIT
description Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
first_indexed 2024-09-23T11:03:33Z
format Thesis
id mit-1721.1/86448
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T11:03:33Z
publishDate 2014
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/864482019-04-10T13:09:01Z Small PCPs with low query complexity Small probabilistically checkable proofs with low query complexity Harsha, Prahladh, 1976- Madhu Sudan. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000. Includes bibliographical references (p. 51-53). by Prahladh Harsha. S.M. 2014-05-07T16:41:56Z 2014-05-07T16:41:56Z 2000 2000 Thesis http://hdl.handle.net/1721.1/86448 46805798 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 53 p. application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Harsha, Prahladh, 1976-
Small PCPs with low query complexity
title Small PCPs with low query complexity
title_full Small PCPs with low query complexity
title_fullStr Small PCPs with low query complexity
title_full_unstemmed Small PCPs with low query complexity
title_short Small PCPs with low query complexity
title_sort small pcps with low query complexity
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/86448
work_keys_str_mv AT harshaprahladh1976 smallpcpswithlowquerycomplexity
AT harshaprahladh1976 smallprobabilisticallycheckableproofswithlowquerycomplexity