Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
From MaRDI portal
Publication:5449791
DOI10.1007/11672142_8zbMath1137.68064OpenAlexW1544886770MaRDI QIDQ5449791
Nitin Saxena, Manindra Agrawal
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_8
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Forms of degree higher than two (11E76) Computational aspects and applications of commutative rings (13P99) Number-theoretic algorithms; complexity (11Y16)
Related Items (7)
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Unnamed Item ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
This page was built for publication: Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms