Nearly linear time isomorphism algorithms for some nonabelian group classes

DOI10.1007/978-3-030-19955-5_8zbMath1491.20005OpenAlexW2952568090MaRDI QIDQ5919682

Bireswar Das, Shivdutt Sharma

Publication date: 22 October 2019

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

Compact data structures for Dedekind groups and finite rings ⋮ Nearly linear time isomorphism algorithms for some nonabelian group classes

This page was built for publication: Nearly linear time isomorphism algorithms for some nonabelian group classes