arXiv (All)
open access
Reduction of the group isomorphism problem to the group automorphism problem
It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is polynomial-time reducible to the group automorphism problem. Red
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
- Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms#268172
- Quantum state isomorphism problems for groups#1155196
- On Some More Problems from the Kourovka Notebook#794031
- On Some More Problems from the Kourovka Notebook#790012
- Acylindrical Hyperbolicity and Pure Conjugating Automorphisms in Graph Products of Groups#822260
Record · ID 984832
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