arXiv Open Access 2016

#P- and $\oplus$P- completeness of counting roots of a sparse polynomial

Alexey Milovanov

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (1)

Alexey Milovanov

Format Sitasi

APA MLA BibTeX

Milovanov, A. (2016). #P- and $\oplus$P- completeness of counting roots of a sparse polynomial. https://arxiv.org/abs/1608.07564

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓