Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
From MaRDI portal
Publication:6566798
DOI10.46298/jgcc.2022.14.1.9431zbMath1540.68103MaRDI QIDQ6566798
Joshua A. Grochow, Gang Tang, Youming Qiao
Publication date: 3 July 2024
Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing \(p\)-groups via Jordan algebras.
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Wildness for tensors
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
- Computing isometry groups of Hermitian maps
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
- STACS 2005
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors
Related Items (1)
This page was built for publication: Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms