scientific article; zbMATH DE number 481965
From MaRDI portal
Publication:4274348
zbMATH Open0794.11048MaRDI QIDQ4274348FDOQ4274348
Authors: Richard Zippel 
Publication date: 14 December 1993
Title of this publication is not available (Why is that?)
Recommendations
interpolationmultivariatecomplexityfactorizationirreducibilitypolynomialsbibliographyeliminationgreatest common divisorunivariateHensel algorithms
Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Computational number theory (11Y99) Research exposition (monographs, survey articles) pertaining to number theory (11-02)
Cited In (58)
- Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability
- Strong versions of impulsive controllability and sampled observability
- Checking properties of polynomials
- Exact hierarchical reductions of dynamical models via linear transformations
- Matrices in elimination theory
- Interrogating witnesses for geometric constraint solving
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Title not available (Why is that?)
- Predicting zero coefficients in formal power series computations.
- Exact linear reduction for rational dynamical systems
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- An improved EZ-GCD algorithm for multivariate polynomials
- Implicitization of curves and (hyper)surfaces using predicted support
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Deformation techniques for sparse systems
- A Gröbner free alternative for polynomial system solving
- Black-box polynomial resultants
- Zero testing of algebraic functions
- Use of algebraically independent numbers for zero recognition of polynomial terms.
- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Lagrange and the solution of numerical equations
- Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem
- Ideals of spaces of degenerate matrices
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- Univariate polynomial factorization over finite fields
- Various new expressions for subresultants and their applications
- Subresultants revisited.
- Noisy interpolation of sparse polynomials in finite fields
- A parser for the interval evaluation of analytical functions and its application to engineering problems
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Linear differential operators for polynomial equations
- Fast computation of discrete invariants associated to a differential rational mapping
- Walks with small steps in the 4D-orthant
- Improved algorithms for computing determinants and resultants
- Methodologies of Symbolic Computation
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Generating power of lazy semantics
- Elimination for generic sparse polynomial systems
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Formalization of Bernstein polynomials and applications to global optimization
- Lifting and recombination techniques for absolute factorization
- Sparse resultants and straight-line programs
- From an approximate to an exact absolute polynomial factorization
- Improved dense multivariate polynomial factorization algorithms
- Computation of unirational fields
- Detecting algebraic curves in bad position
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Treatment of near-breakdown in the CGS algorithm
- Deformation techniques to solve generalised Pham systems
- Parity of the number of irreducible factors for composite polynomials
- A note on systems of equations of power sums
- Fast computation of special resultants
- Zero testing of \(p\)-adic and modular polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4274348)
