A positive relativization of polynomial time vs. polylog space

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 unrel...

Descripción completa

Detalles Bibliográficos
Autor: Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Tipo de recurso: informe técnico
Fecha de publicación:1991
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/328495
Acceso en línea:https://hdl.handle.net/2117/328495
Access Level:acceso abierto
Palabra clave:Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
id ES_c6d23440680a76c83afc58fe7170dfd2
oai_identifier_str oai:upcommons.upc.edu:2117/328495
network_acronym_str ES
network_name_str España
repository_id_str
spelling A positive relativization of polynomial time vs. polylog spaceGavaldà Mestre, Ricard|||0000-0003-4736-7179Computational complexityComplexitat computacionalÀrees temàtiques de la UPC::InformàticaCan 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.19911991-05-0120202020-09-07reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/328495reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/3284952026-05-27T15:37:01Z
dc.title.none.fl_str_mv A positive relativization of polynomial time vs. polylog space
title A positive relativization of polynomial time vs. polylog space
spellingShingle A positive relativization of polynomial time vs. polylog space
Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
title_short A positive relativization of polynomial time vs. polylog space
title_full A positive relativization of polynomial time vs. polylog space
title_fullStr A positive relativization of polynomial time vs. polylog space
title_full_unstemmed A positive relativization of polynomial time vs. polylog space
title_sort A positive relativization of polynomial time vs. polylog space
dc.creator.none.fl_str_mv Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author_facet Gavaldà Mestre, Ricard|||0000-0003-4736-7179
author_role author
dc.subject.none.fl_str_mv Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
topic Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
description 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.
publishDate 1991
dc.date.none.fl_str_mv 1991
1991-05-01
2020
2020-09-07
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/328495
url https://hdl.handle.net/2117/328495
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419104998260736
score 15,301603

Similares en LA Referencia