Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
Flavio Antonio Ferrarotti, Alejandra Lorena Paolet...
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...