On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts

Keyphrases

• NP-hard 100%
• Undecidable 100%
• Sparse Polynomials 100%
• Equivalence Testing 100%
• Circuit Model 50%
• Decision Problems 50%
• Monomial 50%
• Hardness Results 50%
• Models of Computation 50%
• Arithmetic Circuits 50%
• Exponential-time Algorithms 50%
• System of Polynomial Equations 50%
• Rational numbers 50%
• Projection Problem 50%
• Nullstellensatz 50%
• Algebraic Complexity Theory 50%
• Blum-Shub-Smale Model 50%
• ISSAC 50%
• Sparse Representation Model 50%
• Polynomial Projection 50%
• Polynomial Equivalence 50%

Mathematics

• Polynomial 100%
• Circuit Model 12%
• Model of Computation 12%
• Monomials 12%
• Polynomial Equation 12%
• Exponential Time 12%
• Rational Number 12%
• Nullstellensatz 12%