The following pages link to (Q4274348):
Displaying 50 items.
- Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem (Q273361) (← links)
- Zero testing of algebraic functions (Q286968) (← links)
- Black-box polynomial resultants (Q286994) (← links)
- Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach (Q314201) (← links)
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Interrogating witnesses for geometric constraint solving (Q714618) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Parity of the number of irreducible factors for composite polynomials (Q973959) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Treatment of near-breakdown in the CGS algorithm (Q1334209) (← links)
- Generating power of lazy semantics (Q1389632) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Use of algebraically independent numbers for zero recognition of polynomial terms. (Q1426048) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- Predicting zero coefficients in formal power series computations. (Q1599549) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Linear differential operators for polynomial equations (Q1864893) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Exact linear reduction for rational dynamical systems (Q2112154) (← links)
- Ideals of spaces of degenerate matrices (Q2144235) (← links)
- A note on systems of equations of power sums (Q2150618) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- Computation of unirational fields (Q2457397) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections (Q2638368) (← links)
- Semi-numerical absolute factorization of polynomials with integer coefficients (Q2643526) (← links)
- Walks with small steps in the 4D-orthant (Q2660138) (← links)
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Checking properties of polynomials (Q4571953) (← links)
- A parser for the interval evaluation of analytical functions and its application to engineering problems (Q5933504) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Lagrange and the solution of numerical equations (Q5953250) (← links)
