scientific article; zbMATH DE number 5485560

zbMath1231.68294MaRDI QIDQ5302071

Christopher Umans

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20)

Related Items (6)

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

This page was built for publication: