Show simple item record

dc.contributor.authorGavaldà Mestre, Ricard
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-09-07T17:37:18Z
dc.date.available2020-09-07T17:37:18Z
dc.date.issued1991-05
dc.identifier.citationGavaldà, R. A positive relativization of polynomial time vs. polylog space. 1991.
dc.identifier.urihttp://hdl.handle.net/2117/328495
dc.description.abstractCan 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.
dc.format.extent7 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-91-15
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshComputational complexity
dc.titleA positive relativization of polynomial time vs. polylog space
dc.typeExternal research report
dc.subject.lemacComplexitat computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.rights.accessOpen Access
local.identifier.drac29226639
dc.description.versionPostprint (published version)
local.citation.authorGavaldà, R.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record