Exploració per autor "Hermo Huguet, Montserrat"

Ara es mostren els items 1-9 de 9

    • Characterizations of logarithmic advice complexity classes 

      Balcázar Navarro, José Luis; Hermo Huguet, Montserrat; Mayordomo, Elvira (1991-12-13)
      Report de recerca
      Accés obert
      The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic advice for polynomial time, are studied. Characterizations are found in terms of Kolmogorov-simple circuits, bounded query ...

    • Comprenssibility and uniform complexity 

      Hermo Huguet, Montserrat (1995-12-20)
      Report de recerca
      Accés obert
      We focus on notions of resource-bounded complexity for infinite binary sequences, and compare both, a definition based on Kobayashi's concept of compressibility, and the uniform approach studied by Loveland. It is known ...

    • Compressibility of infinite binary sequences 

      Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Hermo Huguet, Montserrat (1996-02-06)
      Report de recerca
      Accés obert
      It is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might ...

    • On infinite sequences (almost) as easy as pi 

      Gavaldà Mestre, Ricard; Balcázar Navarro, José Luis; Hermo Huguet, Montserrat (1994-04)
      Report de recerca
      Accés obert
      It is known that infinite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might ...

    • On Kobayashi's compressibility of infinite sequences 

      Hermo Huguet, Montserrat (1993)
      Report de recerca
      Accés obert
      Kojiro Kobayashi's concept of compressibility of infinite sequences is presented. We point out here that there is a greater relationship between this concept of compressibility and the Kolmogorov complexity than we expected. ...

    • On the sparse set conjecture for sets with low density 

      Buhrman, Harry; Hermo Huguet, Montserrat (1994-01-01)
      Report de recerca
      Accés obert
      We study the sparse set conjecture for sets with low density. The sparse set conjecture states that P = NP if and only if there exists a sparse Turing hard set for NP. In this paper we study a weaker variant of the conjecture. ...

    • Polynomial size circuits with low resource-bounded Kolmogorov complexity 

      Hermo Huguet, Montserrat; Mayordomo, Elvira (1991-06)
      Report de recerca
      Accés obert
      It is well-known that the class P/poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P/log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. ...

    • The structure of a logarithmic advice class 

      Hermo Huguet, Montserrat (1993-09)
      Report de recerca
      Accés obert
      The complexity class Full-P/log, corresponding to a form of logarithmic advice for polynomial time, is studied. In order to understand the inner structure of this class, we characterize Full-P/log in terms of Turing ...

    • The Structure of logarithmic advice complexity classes 

      Balcázar Navarro, José Luis; Hermo Huguet, Montserrat (1997-06)
      Report de recerca
      Accés obert
      A nonuniform class called here Full-P/log, due to Ko, is studied. It corresponds to polynomial time with logarithmically long advice. Its importance lies in the structural properties it enjoys, more interesting than ...