Show simple item record

dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationBalcazar, J.L. Adaptive logspace and depth-bounded reducibilities. 1991.
dc.description.abstractWe 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.
dc.format.extent17 p.
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshComputational complexity
dc.titleAdaptive logspace and depth-bounded reducibilities
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
dc.description.versionPostprint (published version)
local.citation.authorBalcazar, J. L.

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain