Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > IRREDUCIBLE POLYNOMIAL:
Reports tagged with irreducible polynomial:
TR17-016 | 31st January 2017
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena

Irreducibility and deterministic r-th root finding over finite fields

Constructing r-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r^e (where r is a prime) over a given finite field \F_q of characteristic p (equivalently, constructing the bigger field \F_{q^{r^e}}). Both these problems have famous randomized ... more >>>




ISSN 1433-8092 | Imprint