Recent Submissions

  • The [Theta]-operator and the low hierarchy 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1992-07)
    Research report
    Open Access
    Long and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we ...
  • Total domination in plane triangulations 

    Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2020-11-09)
    Research report
    Open Access
  • Characterizations of some complexity classes between [theta sub 2 super p] and [delta sub 2 super p] 

    Castro Rabal, Jorge; Seara Ojea, Carlos (1990)
    Research report
    Open Access
    We give some characterizations of the classes P super NP [0(log super k n)]. First, we show that these classes are equal to classes AC super k-1 (N P). Second, we prove that they are also equivalent to some classes defined ...
  • Development of algebraic specifications with constraints 

    Orejas Valdés, Fernando; Sacristán Adinolfi, Vera; Clérici Martínez, Silvia Inés (1989)
    Research report
    Open Access
    A formal framework for the development of algebraic specifications is presented. Ther main issues concerning the approach are the following: we allow to deal with incomplete specifications during the design process. This ...
  • Metric dimension of maximal outerplanar graphs 

    Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Hernández Peñalver, Gregorio; Garcia Olaverri, Alfredo Martin; Tejel, Javier (2019-03-28)
    Research report
    Open Access
  • Trees whose even-degree vertices induce a path are antimagic 

    Lozano Boixadors, Antoni; Mora Giné, Mercè; Seara Ojea, Carlos; Tey Carrera, Joaquín (2019-05-16)
    Research report
    Open Access
    An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels ...