scientific article; zbMATH DE number 3804835

zbMath0509.68029MaRDI QIDQ4747509

Alexander L. Chistov, Dima Yu. Grigoriev

Publication date: 1982

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

zbMATH Keywords

factorizationalgebraic extensions of Qpolynomial time factoring algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algebraic field extensions (12F05) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items

Factoring sparse multivariate polynomials, Irreducibility of multivariate polynomials, Factoring polynomials and primitive elements for special primes, Computer algebra: Past and future, Inversion in finite fields using logarithmic depth, Solving systems of polynomial inequalities in subexponential time, Factoring bivariate sparse (lacunary) polynomials, On Bivariate Polynomial Factorization over Finite Fields, Computational complexity of sentences over fields, Counting curves and their projections, Complexity of solving parametric polynomial systems, A Gröbner free alternative for polynomial system solving, The computational complexity of recognizing permutation functions, Complexity of deciding Tarski algebra, Functional decomposition of polynomials: the wild case, Deterministic irreducibility testing of polynomials over large finite fields, Complexity of factoring and calculating the GCD of linear ordinary differential operators, Factoring multivariate polynomials over finite fields