ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
From MaRDI portal
Publication:3233231
DOI10.1093/QMATH/7.1.110zbMATH Open0071.01703OpenAlexW2012987274MaRDI QIDQ3233231FDOQ3233231
Authors: Štefan Schwarz 
Publication date: 1956
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/7.1.110
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring Polynomials Over Large Finite Fields
- Title not available (Why is that?)
- Deterministic distinct-degree factorization of polynomials over finite fields
- On Polynomial Factorization Over Finite Fields
- Univariate polynomial factorization over finite fields
- Factoring polynomials over finite fields: A survey
- Reduction of an algebraic function field modulo a prime in the constant field
- Subquadratic-time factoring of polynomials over finite fields
- On the number of irreducible factors of degree k dividing a given polynomial over GF(q)
- Stefan Schwarz (1914–1996)
- Title not available (Why is that?)
This page was built for publication: ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3233231)
