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
equivalence problemfinite nonsolvable groupspolynomial-time complexityco-NP-complete problemscoloring problem for graphs
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)
This page was built for publication: The complexity of the equivalence problem for nonsolvable groups