Incrementally verifiable computation or knowledge implies time/space efficiency
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007. === Includes bibliographical references (p. 35-36). === The probabilistically checkable proof (PCP) system enables proofs to be verified in time polylogarithmic in the length of a classi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/38663 |