Zero testing and equation solving for sparse polynomials on rectangular domains

DOI10.1016/j.ffa.2024.102379arXiv2305.19669MaRDI QIDQ6191070

Erhard Aichinger, Paul Hametner, Simon Grünbacher

Publication date: 6 March 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.19669

zbMATH Keywords

finite fieldssolving equationssparse polynomialsidentity checkingrestrictions of polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chevalley's theorem with restricted variables
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
• Démonstration d'une hypothèse de M. Artin
• Chevalley-Warning type results on abelian groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Combinatorial Nullstellensatz
• On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
• Ideals, Varieties, and Algorithms

This page was built for publication: Zero testing and equation solving for sparse polynomials on rectangular domains