Now showing items 1-3 of 3

    • Almost every set in exponential time is P-Bi-Immune 

      Mayordomo, Elvira (1991-11-06)
      External research report
      Open Access
      A set A is P-bi-immune if neither A nor its complement has an infinite subset in P. We investigate here the abundance of P-bi-immune languages in linear-exponential time (E). We prove that the class of P-bi-immune sets ...
    • On the robustness of ALMOST-R 

      Book, Ronald V.; Mayordomo, Elvira (1993-01-01)
      External research report
      Open Access
      We study the classes of the form ALMOST-R, for R a reducibility. This includes, among others, the classes BPP, P, and PH. We give a characterization of this classes in terms of reductions to n-random languages, a subclass ...
    • Polynomial size circuits with low resource-bounded Kolmogorov complexity 

      Hermo Huguet, Montserrat; Mayordomo, Elvira (1991-06)
      External research report
      Open Access
      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. ...