@article{DBLP:journals/eccc/ECCC-TR99-027,
author = {Marek Karpinski and
Igor Shparlinski},
title = {On the Computational Hardness of Testing Square-Freeness
of Sparse Polynomials},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {6},
number = {27},
year = {1999},
ee = {http://eccc.hpi-web.de/eccc-reports/1999/TR99-027/index.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}