scientific article
From MaRDI portal
Publication:3912021
zbMath0462.68025MaRDI QIDQ3912021
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Decidability and field theory (12L05) Polynomials in general fields (irreducibility, etc.) (12E05)
Related Items
Fast parallel absolute irreducibility testing, Irreducibility of multivariate polynomials, Lifting and recombination techniques for absolute factorization, Typical ranks for 3-tensors, nonsingular bilinear maps and determinantal ideals, Straight-line programs in geometric elimination theory, On a generalization of Stickelberger's theorem, Interpolating polynomials from their values, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Improved dense multivariate polynomial factorization algorithms, Computational complexity of sentences over fields, A unified method for multivariate polynomial factorizations, Complexity bounds in elimination theory -- a survey., Sentences over integral domains and their computational complexities, Randomised algorithms, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Functional programming concepts and straight-line programs in computer algebra, Definability and fast quantifier elimination in algebraically closed fields, Probabilistic absolute irreducibility test for polynomials
