Certifying Irreducibility in $${\mathbb Z}[x]$$

DOI10.1007/978-3-030-52200-1_46zbMath1503.13017arXiv2005.04633OpenAlexW3041468611MaRDI QIDQ5041081

John Abbott

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

irreducibilitycertificate

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Uses Software

• CoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on factors in \(\mathbb Z[x\)]
• A Generalized Class of Polynomials that are Hard to Factor
• Every Prime Has a Succinct Certificate
• New Proofs for two Theorems of Capelli

This page was built for publication: Certifying Irreducibility in $${\mathbb Z}[x]$$