Research output per year
Research output per year
Marek Karpinski, Igor Shparlinski
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review
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.
Original language | English |
---|---|
Title of host publication | Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings |
Subtitle of host publication | 13th International Symposium, AAECC-13 Honolulu, Hawaii, USA, November 15–19, 1999 Proceedings |
Editors | Marc Fossorier, Hideki Imai, Shu Lin, Alain Poli |
Place of Publication | Berlin |
Publisher | Springer, Springer Nature |
Pages | 492-497 |
Number of pages | 6 |
ISBN (Electronic) | 9783540467960 |
ISBN (Print) | 9783540667230 |
DOIs | |
Publication status | Published - 1999 |
Event | 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 1999 - Honolulu, United States Duration: 15 Nov 1999 → 19 Nov 1999 |
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Berlin Heidelberg |
Volume | 1719 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other | 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC - 1999 |
---|---|
Country/Territory | United States |
City | Honolulu |
Period | 15/11/99 → 19/11/99 |
Research output: Chapter in Book/Report/Conference proceeding › Foreword/postscript/introduction › peer-review