Recent Submissions

  • Self-reducibility structures and solutions of NP problems 

    Balcázar Navarro, José Luis (1988)
    External research report
    Open Access
    Using polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional ...
  • Tractabilitat de NP i altres classes de complexitat per famílies de circuits booleans 

    Gavaldà Mestre, Ricard (1987-11)
    External research report
    Open Access
    We search for nonuniform analogs of the complexity class N P ¿ coN P. Following mainly the work of Karp and Lipton on these classes, 1) We define two types of polynomial time reducibility, study some of their basic properties ...
  • Self-reducibility 

    Balcázar Navarro, José Luis (1988-11)
    External research report
    Open Access
    New self-reducibility structures are proposed to deal with sets outside the class PSPACE and with sets in logarithmic space complexity classes. General properties derived from the definition are used to prove known results ...
  • Strong and robustly strong polynomial time reducibilities to sparse sets 

    Gavaldà Mestre, Ricard; Balcázar Navarro, José Luis (1988)
    External research report
    Open Access
    Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform ...
  • Examples of CF-bi-inmune and CF-levelable sets in LOGSPACE 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1984)
    External research report
    Open Access
    We find sets in the class LOGSPACE (on-line) that do not have good respectively approximations by context-free languages. For that we introduce the languages CF-bi-inmune and CF-levelable. We prove the results by defining ...
  • Connections among non uniform models for problems requiring high amount of resources 

    Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1985-11)
    External research report
    Open Access
    We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds on some nonuniform complexity measures. After, we use the same methods to give a new characterization of classes defined ...
  • Manual de POSTOFF : nueva versión 

    Balcázar Navarro, José Luis (1985)
    External research report
    Open Access
    Un programa adaptador de textos para que el formateador DSR Runoff se haga amiguete de la impresora LA100. Documentación correspondiente a la versión 3.0. Creado por José Luis Balcázar en la F.I.B. durante 1984.
  • On some "non uniform" complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    External research report
    Open Access
    Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ...
  • Diameter minimization in networks for SIMD machines 

    Beivide Palacio, Ramon; Balcázar Navarro, José Luis (1985)
    External research report
    Open Access
    We propose an algebraic constructive method which allows to find a certain kind of networks having optimal diameter. These interconnection networks have been proposed for SIMD machines. We compare the results with other ...
  • Uniform characterizations of non-uniform complexity measures 

    Balcázar Navarro, José Luis; Díaz Cort, Josep; Gabarró Vallès, Joaquim (1985)
    External research report
    Open Access
    The class PSPACE/ply of sets decided within polynomial space by machines with polynomial advices is characterized in several way: we give an algebraic characterization, a parallel model characterization. Finally we define ...
  • Deriving specifications of embeddings in recursive program design 

    Roselló Balanyà, Celestí; Balcázar Navarro, José Luis; Peña Marí, Ricardo (1989)
    External research report
    Open Access
    The design of recursive functions is a well-studied subject. Design methods require a specification to start with, however, when an embedding design is attempted at, it is not clear how the specification of the embedding ...
  • Optimal distance networks of low degree for parallel computers 

    Beivide Palacio, Ramon; Herrada Lillo, Enrique; Balcázar Navarro, José Luis; Arruabarrena, Agustín (1989)
    External research report
    Open Access
    We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance ...

View more