scientific article; zbMATH DE number 475362
From MaRDI portal
Publication:4273608
zbMath0813.20004MaRDI QIDQ4273608
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
centralizersstabilizerspolynomial-time reductionsNP-complete problemgraph isomorphism problemcomputational complexitiescomputation in permutation groupsintersections of permutation groups
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (44)
Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ A linear-time algorithm for the orbit problem over cyclic groups ⋮ Expanding Generating Sets for Solvable Permutation Groups ⋮ Computing normalisers of intransitive groups ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ \textit{xTras}: a field-theory inspired \textit{xAct} package for Mathematica ⋮ Nominal Unification and Matching of Higher Order Expressions with Recursive Let ⋮ Bases for primitive permutation groups and a conjecture of Babai ⋮ The parallel complexity of graph canonization under abelian group action ⋮ Groups acting on tensor products. ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays ⋮ A Logspace Algorithm for Partial 2-Tree Canonization ⋮ Space efficient representations of finite groups ⋮ A Faster Isomorphism Test for Graphs of Small Degree ⋮ Comparison of Atom Maps ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ On the complexity of matroid isomorphism problem ⋮ SZK proofs for black-box group problems ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice ⋮ On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ ⋮ On the asymmetric complexity of the group-intersection problem ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ A nonadaptive NC checker for permutation group intersection ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Graph Isomorphism is in SPP ⋮ Computing the soluble radical of a permutation group. ⋮ Isomorphism and canonization of tournaments and hypertournaments ⋮ Finding a cycle base of a permutation group in polynomial time ⋮ Algorithmic Problems for Metrics on Permutation Groups ⋮ Coset closure of a circulant S-ring and schurity problem ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Primitive normalisers in quasipolynomial time ⋮ Algorithms for matrix groups and the Tits alternative ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ Public-key cryptography and invariant theory ⋮ Computing transformation semigroups ⋮ A Name Abstraction Functor for Named Sets ⋮ Finding fixed point free elements and small bases in permutation groups
Uses Software
This page was built for publication:
