arXiv (All)
open access
On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.
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 rapid decay property for pairs of discrete groups#155519
- Phase transition for the asymptotic entropy of branching random walks on groups#652401
- Phase transition for the asymptotic entropy of branching random walks on groups#650948
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups#819557
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups#809561
Record · ID 973453
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