Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Adaptive logspace and depth-bounded reducibilities

Thumbnail
View/Open
1400011449.pdf (1,282Mb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/328494

Show full item record
Balcázar Navarro, José LuisMés informacióMés informacióMés informació
Document typeResearch report
Defense date1991-04
Rights accessOpen Access
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
Abstract
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.
CitationBalcazar, J.L. Adaptive logspace and depth-bounded reducibilities. 1991. 
Is part ofLSI-91-14
URIhttp://hdl.handle.net/2117/328494
Collections
  • LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge - Reports de recerca [67]
  • Departament de Ciències de la Computació - Reports de recerca [1.104]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
1400011449.pdf1,282MbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina