Publication:5302071
From MaRDI portal
zbMath1231.68294MaRDI QIDQ5302071
Publication date: 5 January 2009
Related Items
Modular composition modulo triangular sets and applications, Complexity of computation in finite fields, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes, Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields, Taking roots over high extensions of finite fields