Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1999 Copyright 1999 Universität Bonn, Institut für Informatik, Abt. V
85201

On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
Marek Karpinski, Igor Shparlinski
[Download PostScript] [Download PDF]

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

Last Change: 07/05/01 at 14:02:46
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope