Adaptive logspace and depth-bounded reducibilities

We discuss a number of results regarding an important subject: the study of the computational power of depth-bounded reducibilities, their use to classify the complexity of computational problems, and their characterizations in terms of other computational models. In particular, problems arising in...

Descripción completa

Detalles Bibliográficos
Autor: Balcázar Navarro, José Luis|||0000-0003-4248-4528
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/328494
Acceso en línea:https://hdl.handle.net/2117/328494
Access Level:acceso abierto
Palabra clave:Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
id ES_b899fdfb0f1233b1de4e93b12c578dfd
oai_identifier_str oai:upcommons.upc.edu:2117/328494
network_acronym_str ES
network_name_str España
repository_id_str
spelling Adaptive logspace and depth-bounded reducibilitiesBalcázar Navarro, José Luis|||0000-0003-4248-4528Computational complexityComplexitat computacionalÀrees temàtiques de la UPC::InformàticaWe discuss a number of results regarding an important subject: the study of the computational power of depth-bounded reducibilities, their use to classify the complexity of computational problems, and their characterizations in terms of other computational models. In particular, problems arising in the design of concurrent systems are studied, and two kinds of logarithmic space reductions are defined. The first one is nonadaptive and equivalent in many respects to the oracle set model. The second one provides a notion of adaptive logspace reducibility which turns out to characterize precisely depth-bounded reductions. The closures of NP under these reducibilities are also treated. This is a conference delivered at Structure in Complexity Theory 6th Annual Conference, Chicago 1991, and appears in the proceedings in the present form.19911991-04-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/328494reponame: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/3284942026-05-27T15:37:01Z
dc.title.none.fl_str_mv Adaptive logspace and depth-bounded reducibilities
title Adaptive logspace and depth-bounded reducibilities
spellingShingle Adaptive logspace and depth-bounded reducibilities
Balcázar Navarro, José Luis|||0000-0003-4248-4528
Computational complexity
Complexitat computacional
Àrees temàtiques de la UPC::Informàtica
title_short Adaptive logspace and depth-bounded reducibilities
title_full Adaptive logspace and depth-bounded reducibilities
title_fullStr Adaptive logspace and depth-bounded reducibilities
title_full_unstemmed Adaptive logspace and depth-bounded reducibilities
title_sort Adaptive logspace and depth-bounded reducibilities
dc.creator.none.fl_str_mv Balcázar Navarro, José Luis|||0000-0003-4248-4528
author Balcázar Navarro, José Luis|||0000-0003-4248-4528
author_facet Balcázar Navarro, José Luis|||0000-0003-4248-4528
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 We discuss a number of results regarding an important subject: the study of the computational power of depth-bounded reducibilities, their use to classify the complexity of computational problems, and their characterizations in terms of other computational models. In particular, problems arising in the design of concurrent systems are studied, and two kinds of logarithmic space reductions are defined. The first one is nonadaptive and equivalent in many respects to the oracle set model. The second one provides a notion of adaptive logspace reducibility which turns out to characterize precisely depth-bounded reductions. The closures of NP under these reducibilities are also treated. This is a conference delivered at Structure in Complexity Theory 6th Annual Conference, Chicago 1991, and appears in the proceedings in the present form.
publishDate 1991
dc.date.none.fl_str_mv 1991
1991-04-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/328494
url https://hdl.handle.net/2117/328494
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_ 1869417663855329280
score 15,300724

Similares en LA Referencia