Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6969
Title: On IP=PSPACE and Theorems with Narrow Proofs
Authors: Hartmanis, Juris
Chang, Richard
Ranjan, Desh
Rohatgi, Pankaj
Keywords: computer science
technical report
Issue Date: May-1990
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1129
Abstract: Very recently, it was shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of mathematical proofs. In this column, we define the width of a proof in a formal system $\cal F$ and show that it is an intuitively satisfying and robust definition. Then, using the IP = PSPACE result, it is seen that the width of a proof (as opposed to the length) determines how quickly one can give overwhelming evidence that a theorem is provable without showing the full proof.
URI: http://hdl.handle.net/1813/6969
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
90-1129.pdf1.03 MBAdobe PDFView/Open
90-1129.ps230.05 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us