Rohatgi, Pankaj2007-04-232007-04-231991-04http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1198https://hdl.handle.net/1813/7038In 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.1111174 bytes246489 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reporttechnical report