scientific article; zbMATH DE number 1296286

zbMath0927.12004MaRDI QIDQ4248251

Publication date: 7 June 1999

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

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polynomials over finite fields (11T06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Formal power series rings (13F25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01)

Related Items

On the Davenport-Mahler bound ⋮ On the distribution of polynomials with bounded height ⋮ Generating families of irreducible quartics over \(\mathbb {Q}\) ⋮ Lifting and recombination techniques for absolute factorization ⋮ Effective results on the Skolem problem for linear recurrence sequences ⋮ Complexity of real root isolation using continued fractions ⋮ Robustness and Randomness ⋮ A contraction of the Lucas polygon ⋮ Zero-free angular sectors and lens-shaped regions for polynomials, with applications to irreducibility ⋮ NEW FAMILIES OF IRREDUCIBLE TRINOMIALS AND QUADRINOMIALS ⋮ When Does a Given Polynomial with Integer Coefficients Divide Another? ⋮ Relations and bounds for the zeros of graph polynomials using vertex orbits ⋮ Separation bounds for polynomial systems ⋮ On the zeros of univariate E-polynomials ⋮ Bounds on the moduli of polynomial zeros ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Unnamed Item ⋮ Computational aspects of irreducible polynomials ⋮ An analytically treatable model of long-term dynamics in a mean motion resonance with coexisting resonant modes ⋮ Unnamed Item ⋮ Gessel-Stanton's inverse series and a system of \(q\)-polynomials ⋮ Estimations of positive roots of polynomials ⋮ From an approximate to an exact absolute polynomial factorization ⋮ Counting degenerate polynomials of fixed degree and bounded height ⋮ Improvements of Lagrange's bound for polynomial roots ⋮ On the complexity of real root isolation using continued fractions ⋮ An annulus for the zeros of polynomials ⋮ Bounds for the moduli of zeros. ⋮ Theory of computational complexity. Part 9. Transl. from the Russian. ⋮ On the minimum of a positive polynomial over the standard simplex ⋮ Generalized radix representations and dynamical systems. IV ⋮ Recent progress in exact geometric computation ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ Zero counting for a class of univariate Pfaffian functions ⋮ Decomposition and Construction of Neighbourhood Operations Using Linear Algebra ⋮ Highly unique network descriptors based on the roots of the permanental polynomial ⋮ Properties of graph distance measures by means of discrete inequalities ⋮ Counting and Testing Dominant Polynomials ⋮ On a problem in the theory of polynomials ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ Computational Aspects of a Bound of Lagrange ⋮ Factoring polynomials over global fields ⋮ Generalizations of Gonçalves' inequality