#P- and $\oplus$P- completeness of counting roots of a sparse polynomial
Abstract
We improve and simplify the result of the part 4 of "Counting curves and their projections" (Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski) by showing that counting roots of a sparse polynomial over $\mathbb{F}_{2^n}$ is #P- and $\oplus$P-complete under deterministic reductions.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2016
- DOI:
- 10.48550/arXiv.1608.07564
- arXiv:
- arXiv:1608.07564
- Bibcode:
- 2016arXiv160807564M
- Keywords:
-
- Computer Science - Computational Complexity
- E-Print:
- 4 pages