The following pages link to (Q4002529):
Displayed 36 items.
- On the zeroes of two families of polynomials arising from certain rational integrals (Q812498) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- Bounds for resultants of univariate and bivariate polynomials (Q848582) (← links)
- On new higher order families of simultaneous methods for finding polynomial zeros (Q952049) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Enumeration of special sets of polynomials over finite fields (Q1290925) (← links)
- Factoring polynomials over arbitrary finite fields (Q1575686) (← links)
- Algorithms for residues and Łojasiewicz exponents (Q1585067) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices (Q1864875) (← links)
- Testing reducibility of linear differential operators: A group theoretic perspective (Q1912702) (← links)
- \(p\)-irreducibility of binding polynomials (Q1963087) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- A separation bound for real algebraic expressions (Q2391181) (← links)
- Polynomial root separation examples (Q2457387) (← links)
- Galois theory, splitting fields and computer algebra (Q2457393) (← links)
- Splitting fields for characteristic polynomials of matrices with entries in a finite field (Q2469486) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials (Q2564953) (← links)
- Some computations on the spectra of Pisot and Salem numbers (Q2781224) (← links)
- On the location of critical points of polynomials (Q3151202) (← links)
- On efficient computation and asymptotic sharpness of Kalantari’s bounds for zeros of polynomials (Q3420238) (← links)
- Much Ado about Zero (Q3644735) (← links)
- Computing automorphisms of abelian number fields (Q4240588) (← links)
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases (Q4292068) (← links)
- On a New Factorization Algorithm for Polynomials Over Finite Fields (Q4325734) (← links)
- Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers (Q4425443) (← links)
- Counting solutions to trinomial Thue equations: a different approach (Q4485705) (← links)
- A contraction of the Lucas polygon (Q4813722) (← links)
- Distinct Degree Factorizations for Polynomials over a Finite Field (Q4846077) (← links)
- Detecting algebraic curves in bad position (Q5937884) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions (Q5945288) (← links)