Irreducibility and Deterministic r-th Root Finding over Finite Fields

DOI10.1145/3087604.3087620zbMath1472.11297arXiv1702.00558OpenAlexW2738376247MaRDI QIDQ5119920

Rajat Mittal, Vishwas Bhargava, Gábor Ivanyos, Nitin Saxena

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00558

zbMATH Keywords

finite fieldsdeterministic higher root finding

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

This page was built for publication: Irreducibility and Deterministic r-th Root Finding over Finite Fields