arXiv (All)
open access
Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general polynomial-time algorithm is known, classes of solvable and nilp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Aldous property for normal Cayley graphs on symmetric groups#635940
- The Aldous property for normal Cayley graphs on symmetric groups#633591
- Quantum state isomorphism problems for groups#1155196
- Problems Between P and NPC#787503
- CMSO-transductions for tree-like graph decompositions#1156169
Record · ID 985104
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive