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
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Adaptive logspace reducibility and parallel time

Thumbnail
View/Open
1400012817.pdf (1,244Mb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/330912

Show full item record
Álvarez Faura, M. del CarmeMés informacióMés informacióMés informació
Balcázar Navarro, José LuisMés informacióMés informacióMés informació
Jenner, Birgit
Document typeResearch report
Defense date1991-11
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 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.
CitationAlvarez, C.; Balcazar, J.L.; Jenner, B. Adaptive logspace reducibility and parallel time. 1991. 
Is part ofLSI-91-48
URIhttp://hdl.handle.net/2117/330912
Collections
  • ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals - Reports de recerca [139]
  • 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
1400012817.pdf1,244MbPDFView/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