Probabilistic absolute irreducibility test for polynomials
From MaRDI portal
Publication:1612137
DOI10.1016/S0022-4049(01)00165-7zbMath1011.12011MaRDI QIDQ1612137
Publication date: 22 August 2002
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Lifting and recombination techniques for absolute factorization ⋮ On the number of polynomial solutions of Bernoulli and Abel polynomial differential equations ⋮ Modular Las Vegas algorithms for polynomial absolute factorization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast parallel absolute irreducibility testing
- Equations over finite fields. An elementary approach
- Effective Noether irreducibility forms and applications
- Counting polynomials with zeros of given multiplicities in finite fields
- The distribution of irreducible polynomials in several indeterminates
- Absolute Factorization of Polynomials: A Geometric Approach
- On the parallel Risch Algorithm (II)
- Factoring Rational Polynomials over the Complex Numbers
- The Distribution of Irreducible Polynomials in Several Indeterminates II
- The distribution of irreducible polynomials in several indeterminates over a finite field
- The Distribution of Absolutely Irreducible Polynomials in Several Indeterminates
This page was built for publication: Probabilistic absolute irreducibility test for polynomials