Exploració per autor "Seara Ojea, Carlos"
Ara es mostren els items 46-51 de 51
-
The [Theta]-operator and the low hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos (1992-07)
Report de recerca
Accés obertLong 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 ... -
The alternating path problem revisited
Claverol Aguas, Mercè; Garijo, Delia; Hurtado Díaz, Fernando Alfredo; Lara Cuevas, María Dolores; Seara Ojea, Carlos (Universidad de Sevilla, 2013)
Text en actes de congrés
Accés obertIt is well known that, given "n" red points and "n" blue points on acircle, it is not always possible to find a plane geometric. Hamiltonian alternating path. In this work we prove that if we relax the constraint on the ... -
The Plogi and ACi-1 operators on the polynomial time hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos (1993-11)
Report de recerca
Accés obertIn a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ... -
The Ø-operator and the low hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos (Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993)
Text en actes de congrés
Accés obertLong and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the Θ-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of N P. In this paper we show ... -
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)
Report de recerca
Accés obertAn 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 ... -
Trees whose even-degree vertices induce a path are antimagic
Lozano Boixadors, Antoni; Mora Giné, Mercè; Seara Ojea, Carlos; Tey Carrera, Joaquín (2022-08)
Article
Accés obertAn 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 ...