Monte-Carlo Irreducibility and Imprimitivity Detection of Polynomials over \mathbb{Q}

MaRDI QIDQ7215596arXivFDO

Authors Igor Rivin

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Separable extensions, Galois theory (12F10) Analysis of algorithms (68W40)

arXiv classification

math.NT

This page was built for publication: Monte-Carlo Irreducibility and Imprimitivity Detection of Polynomials over $\mathbb{Q}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7215596)