scientific article; zbMATH DE number 1273636
From MaRDI portal
Publication:4237366
zbMath0955.11500MaRDI QIDQ4237366
Publication date: 14 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (12)
Computing Frobenius maps and factoring polynomials ⋮ Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ A subquadratic algorithm for computing the $n$-th Bernoulli number ⋮ Modular composition modulo triangular sets and applications ⋮ Univariate polynomial factorization over finite fields ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Unnamed Item ⋮ On Bivariate Polynomial Factorization over Finite Fields ⋮ Threshold data structures and coding theory ⋮ Factoring polynomials over arbitrary finite fields ⋮ Deterministic root finding in finite fields
This page was built for publication:
