88 search results - page 8 / 18 » On the Complexity of Matroid Isomorphism Problem |
131
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
104
Voted
WEA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
125
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
127
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
172
Voted
LICS
2000
IEEE
15 years 7 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...