A Note on Time-Space Bounded Interactive Protocols.
| dc.contributor.author | Rohatgi, Pankaj | en_US |
| dc.date.accessioned | 2007-04-23T17:52:48Z | |
| dc.date.available | 2007-04-23T17:52:48Z | |
| dc.date.issued | 1991-04 | en_US |
| dc.description.abstract | In this paper, we examine the power of time-space bounded interactive protocols with private coins. The class of languages having logspace, polynomial-time bounded private coin protocols is exactly PSPACE. We generalize this result to other time-space bounded protocols. As a consequence we obtasin that EXPSPACE is exactly the class of languages having polynomial-space, exponential-time bounded private coin interactive protocols. This coupled with earlier work by Condon, Fortnow and Lund gives us the following characterization of standard complexity classes in terms of time-space bounded interactive protocols. | en_US |
| dc.format.extent | 1111174 bytes | |
| dc.format.extent | 246489 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1198 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7038 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Note on Time-Space Bounded Interactive Protocols. | en_US |
| dc.type | technical report | en_US |