Efficient algorithms for some special cases of the polynomial equivalence problem
From MaRDI portal
Recommendations
- Progress in Cryptology - INDOCRYPT 2003
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
- Testing polynomial equivalence by scaling matrices
- Graph-theoretic algorithms for the ``isomorphism of polynomials problem
Cited in
(36)- Testing polynomial equivalence by scaling matrices
- Sieve method for polynomial linear equivalence
- General linear group action on tensors: a candidate for post-quantum cryptography
- Diagonalizable higher degree forms and symmetric tensors
- Linear projections of the Vandermonde polynomial
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Unifying known lower bounds via geometric complexity theory
- Isomorphism testing of read-once functions and polynomials
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- Random arithmetic formulas can be reconstructed efficiently
- Graph-theoretic algorithms for the ``isomorphism of polynomials problem
- Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- Determinant Equivalence Test over Finite Fields and over Q
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
- Linear independence, alternants, and applications
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
- On the Koiran-Skomra's question about Hessians
- Linear independence, alternants and applications
- Last fall degree of semilocal polynomial systems
- NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
- On semi-local decomposition
- Testing equivalence to design polynomials
- Tensor reconstruction beyond constant rank
- Derandomizing multivariate polynomial factoring for low degree factors
- Simultaneous direct sum decompositions of several multivariate polynomials
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms
- Derandomization and absolute reconstruction for sums of powers of linear forms
This page was built for publication: Efficient algorithms for some special cases of the polynomial equivalence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365127)
