On the nn isomorphism technique (preliminary report)
From MaRDI portal
Publication:5402540
Recommendations
- An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique
- scientific article; zbMATH DE number 3933088
- Beating the generator-enumeration bound for solvable-group isomorphism
Cited in
(51)- Permutation group approach to association schemes
- Graph isomorphism problem
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- On nondeterminism in parallel computation
- On deciding switching equivalence of graphs
- Complexity bounds for equivalence and isomorphism of latin squares
- Concerning the complexity of deciding isomorphism of block designs
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Constructive complexity
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique
- Graph isomorphism, general remarks
- Nondeterministics circuits, space complexity and quasigroups
- Subcomplete generalizations of graph isomorphism
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
- Bounds on the number of autotopisms and subsquares of a Latin square
- On isomorphism testing of groups with normal Hall subgroups
- Linear time algorithms for Abelian group isomorphism and related problems
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- Steiner triple systems of order 19 with nontrivial automorphism group
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- On the automorphism groups of strongly regular graphs. II.
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- Algorithms for group isomorphism via group extensions and cohomology
- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Nearly linear time isomorphism algorithms for some nonabelian group classes
- Computing Autotopism Groups of Partial Latin Rectangles
- On the complexity of identifying strongly regular graphs
- Algorithms and complexity for counting configurations in Steiner triple systems
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Faster isomorphism for p-groups of class 2 and exponent p
- Count-free Weisfeiler-Leman and group isomorphism
- Linear space data structures for finite groups with constant query-time
- Classifying primitive solvable permutation groups of rank \(5\) and \(6\)
- Complexity of identifying fitting-free groups
- On the complexity of problems on graphs defined on groups
- On the descriptive complexity of groups without abelian normal subgroups
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- The logics for the complexity classes with limited non-determinism
- On the constant-depth circuit complexity of generating quasigroups
- On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
- Smooth cuboids in group theory
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- Constant depth circuit complexity for generating quasigroups
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- The isomorphism problem of power graphs and a question of Cameron
- Reduction of the group isomorphism problem to the group automorphism problem
- Parallel complexity of identifying groups and quasigroups via decompositions
- Aspects of the commuting graph
This page was built for publication: On the \(n\log{n}\) isomorphism technique (preliminary report)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402540)
