Adaptive logspace reducibility and parallel time

We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still be read on while the next query is already being constructed. The first notio...

Descripción completa

Detalles Bibliográficos
Autores: Álvarez Faura, M. del Carme|||0000-0003-2352-0546, Balcázar Navarro, José Luis|||0000-0003-4248-4528, Jenner, Birgit
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/330912
Acceso en línea:https://hdl.handle.net/2117/330912
Access Level:acceso abierto
Palabra clave:Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
id ES_c7d2a247327f124ce31c9fa5faaf4e7a
oai_identifier_str oai:upcommons.upc.edu:2117/330912
network_acronym_str ES
network_name_str España
repository_id_str
spelling Adaptive logspace reducibility and parallel timeÁlvarez Faura, M. del Carme|||0000-0003-2352-0546Balcázar Navarro, José Luis|||0000-0003-4248-4528Jenner, BirgitComputational complexityComplexitat computacionalÀrees temàtiques de la UPC::InformàticaWe discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still be read on while the next query is already being constructed. The first notion turns out to be basically non-adaptive, behaving like access to an oracle set. The second notion, on the other hand, is adaptive. By imposing appropriate bounds on the number of functional oracle queries made in this computation model, we obtain new characterizations of the NC and AC hierarchies; thus the number of oracle queries can be considered as a measure of parallel time. Using this characterization of parallel classes, we solve open questions of Wilson.19911991-11-0120202020-10-28reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/330912reponame: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/3309122026-05-27T15:37:01Z
dc.title.none.fl_str_mv Adaptive logspace reducibility and parallel time
title Adaptive logspace reducibility and parallel time
spellingShingle Adaptive logspace reducibility and parallel time
Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
title_short Adaptive logspace reducibility and parallel time
title_full Adaptive logspace reducibility and parallel time
title_fullStr Adaptive logspace reducibility and parallel time
title_full_unstemmed Adaptive logspace reducibility and parallel time
title_sort Adaptive logspace reducibility and parallel time
dc.creator.none.fl_str_mv Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Balcázar Navarro, José Luis|||0000-0003-4248-4528
Jenner, Birgit
author Álvarez Faura, M. del Carme|||0000-0003-2352-0546
author_facet Álvarez Faura, M. del Carme|||0000-0003-2352-0546
Balcázar Navarro, José Luis|||0000-0003-4248-4528
Jenner, Birgit
author_role author
author2 Balcázar Navarro, José Luis|||0000-0003-4248-4528
Jenner, Birgit
author2_role author
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 We discuss two notions of functional oracle for logarithmic space-bounded machines, which differ in whether there is only one oracle tape for both the query and the answer or a separate tape for the answer, which can still be read on while the next query is already being constructed. The first notion turns out to be basically non-adaptive, behaving like access to an oracle set. The second notion, on the other hand, is adaptive. By imposing appropriate bounds on the number of functional oracle queries made in this computation model, we obtain new characterizations of the NC and AC hierarchies; thus the number of oracle queries can be considered as a measure of parallel time. Using this characterization of parallel classes, we solve open questions of Wilson.
publishDate 1991
dc.date.none.fl_str_mv 1991
1991-11-01
2020
2020-10-28
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/330912
url https://hdl.handle.net/2117/330912
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_ 1869419212391317504
score 15,300724

Similares en LA Referencia