Polynomial-time algorithms for black-box distributive expanded groups
From MaRDI portal
Cites work
- Algorithms for black-box fields and their application to cryptography
- Computing primitive idempotents in finite commutative rings and applications
- Decidability of classes of algebraic systems in polynomial time
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- Fast Management of Permutation Groups I
- Fast Monte Carlo algorithms for permutation groups
- Groups with Multiple Operators
- scientific article; zbMATH DE number 3720983 (Why is no real title available?)
- scientific article; zbMATH DE number 3758564 (Why is no real title available?)
- scientific article; zbMATH DE number 1284153 (Why is no real title available?)
- scientific article; zbMATH DE number 475356 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3396154 (Why is no real title available?)
- Real reduced multirings and multifields
- The Complexity of Black-Box Ring Problems
- There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups
- Über eine besondere Klasse von Gruppen.
This page was built for publication: Polynomial-time algorithms for black-box distributive expanded groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309768)