The complexity of the equivalence problem for nonsolvable groups

DOI10.1112/blms/bdm030zbMath1167.20019OpenAlexW2092435018MaRDI QIDQ5297585

No author found.

Publication date: 12 July 2007

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/bdm030

zbMATH Keywords

equivalence problemfinite nonsolvable groupspolynomial-time complexityco-NP-complete problemscoloring problem for graphs

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (19)

Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$ ⋮ Complexity of the identity checking problem for finite semigroups. ⋮ Complexity issues of checking identities in finite monoids ⋮ Satisfiability in MultiValued Circuits ⋮ A survey on varieties generated by small semigroups and a companion website ⋮ Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). ⋮ Identities of the Kauffman monoid K3 ⋮ Identities in twisted Brauer monoids ⋮ Identities in upper triangular tropical matrix semigroups and the bicyclic monoid ⋮ Identity checking problem for transformation monoids ⋮ The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. ⋮ The complexity of the equation solvability problem over semipattern groups ⋮ THE EQUIVALENCE PROBLEM OVER FINITE RINGS ⋮ Word problem of the Perkins semigroup via directed acyclic graphs. ⋮ An assertion concerning functionally complete algebras and NP-completeness ⋮ The equation solvability problem over supernilpotent algebras with Mal’cev term ⋮ The complexity of the equation solvability and equivalence problems over finite groups ⋮ THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS ⋮ The complexity of the equivalence and equation solvability problems over meta-abelian groups

This page was built for publication: The complexity of the equivalence problem for nonsolvable groups