scientific article; zbMATH DE number 1263216
From MaRDI portal
Publication:4234088
zbMath0921.11068MaRDI QIDQ4234088
Erich L. Kaltofen, Victor Shoup
Publication date: 29 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmsnormal basesfactoring univariate polynomials over finite fieldsbaby step/giant step
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Factorization (11Y05)
Related Items (4)
New Sparse Multivariate Polynomial Factorization Algorithms over Integers ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ Complexity of solving parametric polynomial systems ⋮ Fast rectangular matrix multiplication and applications
This page was built for publication:
