Exploració per autor "Esteban Ángeles, Juan Luis"
Ara es mostren els items 1-13 de 13
-
A correction on Shiloach's algorithm for minimum linear arrangement of trees
(2017-06-29)
Article
Accés obertMore than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on ... -
Are crossing dependencies really scarce?
(2018-03-01)
Article
Accés obertThe syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that the number of edge crossings in real ... -
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
(Springer, 2019)
Text en actes de congrés
Accés obertPseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must ... -
Bounds of the sum of edge lengths in linear arrangements of trees
(Institute of Physics (IOP), 2021-02-11)
Article
Accés obertA fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate ... -
Complexity measures for resolution
(Universitat Politècnica de Catalunya, 2003-12-15)
Tesi
Accés obertEsta obra es una contribución al campo de la Complejidad de la Demostración, que estudia la complejidad de los sistemas de demostración en términos de los recursos necesarios para demostrar o refutar fórmulas proposicionales. ... -
Cota inferior exponencial de la longitud de la demostración por resolución
(1994)
Report de recerca
Accés obertPresentamos una demostración simplificada de que la resolución con o sin restricciones no es un supersistema de demostración, es decir, hay fórmulas cuya longitud de la demostración por resolución más corta no se puede ... -
Exponential separation between tree-like and dag-like Cutting Planes proof systems
(1997-12)
Report de recerca
Accés obertWe prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential separation between tree-like and dag-like ... -
Minimum projective linearizations of trees in linear time
(2022-03)
Article
Accés obertThe Minimum Linear Arrangement problem (MLA) consists of finding a mapping π from vertices of a graph to distinct integers that minimizes {u,v}∈E |π(u) − π(v)|. In that setting, vertices are often assumed to lie on a ... -
On the complexity of resolution with bounded conjunctions
(2003-06)
Report de recerca
Accés obertWe analyze size and space complexity of Res(k), a family of propositional proof systems introduced by Kraj which extend Resolution by allowing disjunctions of conjunctions of up to 1$ literals. We show that the ... -
Optimality of syntactic dependency distances
(American Institute of Physics (AIP), 2022-01-01)
Article
Accés obertIt is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score ... -
The linear arrangement library: A new tool for research on syntactic dependency structures
(Association for Computational Linguistics, 2022)
Comunicació de congrés
Accés obertThe new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic ... -
The maximum linear arrangement problem for trees under projectivity and planarity
(2024-01-01)
Article
Accés restringit per política de l'editorialA linear arrangement is a mapping p from the n vertices of a graph G to n distinct consecutive integers. Linear arrangements can be represented by drawing the vertices along a horizontal line and drawing the edges as ... -
The scaling of the minimum sum of edge lengths in uniformly random trees
(Institute of Physics (IOP), 2016-06-21)
Article
Accés obertThe minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on ...
