248 search results - page 18 / 50 » On the Cayley isomorphism problem |
AMW
2011
13 years 2 months ago
2011
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...
JUCS
2010
13 years 5 months ago
2010
: 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...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
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...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
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...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
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...