scientific article
From MaRDI portal
Publication:3345783
zbMath0552.68048MaRDI QIDQ3345783
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
primitive idempotentsprobabilistic algorithmaverage complexityalgorithms for factoring univariate polynomials over finite fields
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06)
Related Items
Univariate polynomial factorization over finite fields, On tries, contention trees and their analysis