Small PCPs with low query complexity
Name
46805798-MIT.pdf
Description
Full printable version
Size
2.08 MB
Format
Adobe PDF
Checksum (MD5)
a128d31638780091b6d6e9fcc45dedc6
Author(s)
Harsha, Prahladh, 1976-
Advisor(s)
Madhu Sudan.
Alternative Title
Small probabilistically checkable proofs with low query complexity
Date Issued
2000
Publisher
Massachusetts Institute of Technology
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (p. 51-53).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
