scientific article; zbMATH DE number 503193
From MaRDI portal
Publication:4279514
zbMath0809.68072MaRDI QIDQ4279514
Marek Karpinski, Dima Yu. Grigoriev
Publication date: 17 February 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Numerical interpolation (65D05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10)
Related Items (10)
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases ⋮ Testing the shift-equivalence of polynomials using quantum machines ⋮ Sparse shifts for univariate polynomials ⋮ Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. ⋮ A local decision test for sparse polynomials ⋮ A Wronskian approach to the real \(\tau\)-conjecture ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ An algorithm for deciding the summability of bivariate rational functions ⋮ Reconstruction algorithms for sums of affine powers ⋮ Zero testing of \(p\)-adic and modular polynomials
This page was built for publication:
