Show simple item record

dc.contributor.authorHartmanis, Jurisen_US
dc.contributor.authorChang, Richarden_US
dc.contributor.authorRanjan, Deshen_US
dc.contributor.authorRohatgi, Pankajen_US
dc.date.accessioned2007-04-23T17:47:46Z
dc.date.available2007-04-23T17:47:46Z
dc.date.issued1990-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1129en_US
dc.identifier.urihttps://hdl.handle.net/1813/6969
dc.description.abstractVery 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.en_US
dc.format.extent1054474 bytes
dc.format.extent235567 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn IP=PSPACE and Theorems with Narrow Proofsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics