@inbook{3f02602b6fe247838b8ea3a5377c62f7,
title = "On the computational hardness of testing square-freeness of sparse polynomials",
abstract = "We show that deciding square-freeness of a sparse univariate polynomial over ZZ and over the algebraic closure of a finite field F p of p elements is NP-hard. We also discuss some related open problems about sparse polynomials.",
author = "Marek Karpinski and Igor Shparlinski",
year = "1999",
doi = "10.1007/3-540-46796-3_47",
language = "English",
isbn = "9783540667230",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Springer Nature",
pages = "492--497",
editor = "Marc Fossorier and Hideki Imai and Shu Lin and Alain Poli",
booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings",
address = "United States",
note = "13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 1999 ; Conference date: 15-11-1999 Through 19-11-1999",
}