Counting Roots of Polynomials Over Prime Power Rings

Counting Roots of Polynomials Over Prime Power Rings

Suppose \(p\) is a prime, \(t\) is a positive integer, and \(f\!\in\!\mathbb{Z}[x]\) is a univariate polynomial of degree \(d\) with coefficients of absolute value \(

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2017-11
Hauptverfasser: Cheng, Qi, Gao, Shuhong, Rojas, J Maurice, Wan, Daqing
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Complexity
Computer Science - Symbolic Computation
Functions (mathematics)
Mathematical analysis
Mathematics - Number Theory
Polynomials
Rings (mathematics)
Roots
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Suppose \(p\) is a prime, \(t\) is a positive integer, and \(f\!\in\!\mathbb{Z}[x]\) is a univariate polynomial of degree \(d\) with coefficients of absolute value \(
ISSN:2331-8422
DOI:10.48550/arxiv.1711.01355