A positive relativization of polynomial time vs. polylog space

View/Open
Cita com:
hdl:2117/328495
Document typeResearch report
Defense date1991-05
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
Can every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that is fair, in the sense that it maintains all known relationships between unrelativized PSPACE and EXPTIME.
CitationGavaldà, R. A positive relativization of polynomial time vs. polylog space. 1991.
Is part ofLSI-91-15
Files | Description | Size | Format | View |
---|---|---|---|---|
1400011450.pdf | 366,5Kb | View/Open |