scientific article

Publication date: 18 September 1992

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

complexity polynomials factorization primality

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Polynomials over finite fields (11T06) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05) Primality (11Y11) Research exposition (monographs, survey articles) pertaining to field theory (12-02)

Related Items

Graph compression and the zeros of polynomials, Bounds for resultants of univariate and bivariate polynomials, A contraction of the Lucas polygon, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, A separation bound for real algebraic expressions, ESTIMATION OF COMPUTATIONAL COST OF AN AUTOCORRELATION FUNCTION OF LINEAR RECURRING SEQUENCES OVER, Testing reducibility of linear differential operators: A group theoretic perspective, On the complexity of computing the topology of real algebraic space curves, Absolute Real Root Separation, Determinantal representation of trigonometric polynomial curves via Sylvester method, A novel solution to the P4P problem for an uncalibrated camera, On the complexity of computing the greatest common divisor of several univariate polynomials, SONC optimization and exact nonnegativity certificates via second-order cone programming, On sets of linear forms of maximal complexity, On the location of roots of non-reciprocal integer polynomials, Certified rational parametric approximation of real algebraic space curves with local generic position method, Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, On congruences with products of variables from short intervals and applications, \(p\)-irreducibility of binding polynomials, A generic position based method for real root isolation of zero-dimensional polynomial systems, Polynomial root separation examples, Galois theory, splitting fields and computer algebra, Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials, Product of subsets of small intervals and points on exponential curves modulo a prime, Computing real roots of real polynomials, Splitting fields for characteristic polynomials of matrices with entries in a finite field, On new higher order families of simultaneous methods for finding polynomial zeros, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Distinct Degree Factorizations for Polynomials over a Finite Field, Multiplicative congruences with variables from short intervals, Resolution of single-variable fuzzy polynomial equations and an upper bound on the number of solutions, Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases, Evaluating geometric queries using few arithmetic operations, Various new expressions for subresultants and their applications, Detecting algebraic curves in bad position, Construction of determinantal representation of trigonometric polynomials, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions, Some computations on the spectra of Pisot and Salem numbers, Distance bounds of \(\varepsilon\)-points on hypersurfaces, On exact Reznick, Hilbert-Artin and Putinar's representations, Exact, efficient, and complete arrangement computation for cubic curves, Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers, On a New Factorization Algorithm for Polynomials Over Finite Fields, On a generalization of Schur theorem concerning resultants, Sampling polynomial trajectories for LTL verification, Exotic quantifiers, complexity classes, and complete problems, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Much Ado about Zero, Factoring polynomials over arbitrary finite fields, Enumeration of special sets of polynomials over finite fields, An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials, Counting solutions to trinomial Thue equations: a different approach, On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials, A key exchange protocol based on Diophantine equations and S-integers, Algorithms for residues and Łojasiewicz exponents, Absolute Root Separation, Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices, Computing automorphisms of abelian number fields, On the zeroes of two families of polynomials arising from certain rational integrals, On the location of critical points of polynomials