On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials

Authors:
Marek Karpinski;Igor Shparlinski
Affiliations:
-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 11
Cited 2

Irreducibility of multivariate polynomials

Journal of Computer and System Sciences
Factoring sparse multivariate polynomials

Journal of Computer and System Sciences
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields

SIAM Journal on Computing
Computational Complexity of Sparse Rational Interpolation

SIAM Journal on Computing
Fast construction of irreducible polynomials over finite fields

Journal of Symbolic Computation
On computing greatest common divisors with polynomials given by black boxes for their evaluations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On some approximation problems concerning sparse polynomials over finite fields

Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
A polynomial time algorithm for diophantine equations in one variable

Journal of Symbolic Computation
Extended Hilbert irreducibility and its applications

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Factoring bivariate lacunary polynomials without heights

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that deciding square-freeness of a sparse univariate polynomial over Z and over the algebraic closure of a finite field Fp of p elements is NP-hard. We also discuss some related open problems about sparse polynomials.