Exploració per autor "Jenner Núñez, Birgit"

Ara es mostren els items 1-5 de 5

    • Computing functions with parallel queries to NP 

      Jenner Núñez, Birgit; Torán Romero, Jacobo (1993-03)
      Report de recerca
      Accés obert
      The class "Theta_2^p" of languages polynomial time truth-table reducible to sets in NP has a wide range of different characterizations. We survey some of them studying the classes obtained when the characterizations are ...

    • Concatenation versus addition in knapsack problems 

      Jenner Núñez, Birgit (1993-01)
      Report de recerca
      Accés obert
      "Appeared in Information Processing Letters 54 (1995),169-174. We consider the complexity of two knapsack problems that are defined with the operation ``concatenation'' instead of ``addition''. Whereas both addition ...

    • Functional oracle queries as a measure of parallel time 

      Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Jenner Núñez, Birgit (1990-08)
      Report de recerca
      Accés obert
      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 ...

    • Logarithmic space counting classes 

      Álvarez Faura, M. del Carme; Jenner Núñez, Birgit (1990-01)
      Report de recerca
      Accés obert
      We consider the logarithmic space counting classes #L, opt-L, and span-L, which are defined analogously to their polynomial time counterparts. We obtain complete functions for these three classes in terms of graphs and ...

    • On dlogtime and polylogtime reductions 

      Álvarez Faura, M. del Carme; Jenner Núñez, Birgit (Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993)
      Text en actes de congrés
      Accés obert
      We investigate properties of the relativized NC and AC hierarchies in their DLOGTIME-. respectively, ALOGTIME-uniform setting and show that these hierarchies can be characterized in terms of adaptive reducibility in ...