Properties of cryptosystem PGM
CRYPTO '89 Proceedings on Advances in cryptology
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Nonadaptive NC Checker for Permutation Group Intersection
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the asymmetric complexity of the group-intersection problem
Information Processing Letters
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
Information and Computation
On the complexity of the hidden subgroup problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Deterministic POMDPs revisited
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Complexity classes of equivalence problems revisited
Information and Computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithms for solving Rubik's cubes
ESA'11 Proceedings of the 19th European conference on Algorithms
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Linear optimization over permutation groups
Discrete Optimization
Polynomial-time isomorphism test for groups with no abelian normal subgroups
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Pseudorandom generators based on subcovers for finite groups
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
On the resolution complexity of graph non-isomorphism
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.