Pages that link to "Item:Q4053736"
From MaRDI portal
The following pages link to An Inequality About Factors of Polynomials (Q4053736):
Displaying 44 items.
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Factoring polynomials and the knapsack problem (Q701105) (← links)
- On p-adic computation of the rational form of a matrix (Q751188) (← links)
- Fast Hensel's lifting implementation using partial fraction decomposition (Q1074651) (← links)
- Computing the measure of a polynomial (Q1093675) (← links)
- An inequality about irreducible factors of integer polynomials (Q1104972) (← links)
- Computer algebra applied to itself (Q1106662) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- Factoring polynomials with rational coefficients (Q1165896) (← links)
- The distribution of the zeros generated by length-bounded polynomials (Q1174936) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Polynomial time algorithms for sentences over number fields (Q1187032) (← links)
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result (Q1198240) (← links)
- Algorithms related to the decomposition of polynomials (Q1224854) (← links)
- Linear forms in two logarithms and Schneider's method (Q1234713) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- On computing subfields. A detailed description of the algorithm (Q1292617) (← links)
- Factoring multivariate integral polynomials (Q1348530) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- On the smallest number of terms of vanishing sums of units in number fields (Q1786703) (← links)
- Computing rational forms of integer matrices (Q1864883) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Improving root separation bounds (Q2399862) (← links)
- Factoring polynomials over global fields. I (Q2456562) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- Generalizations of Gonçalves' inequality (Q3419993) (← links)
- Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme (Q3483364) (← links)
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- Computing Omega-Limit Sets in Linear Dynamical Systems (Q3543335) (← links)
- Factoring Multivariate Polynomials over Algebraic Number Fields (Q4100173) (← links)
- An Improved Multivariate Polynomial Factoring Algorithm (Q4168687) (← links)
- Polynomial Minimum Root Separation (Q4190721) (← links)
- New Algorithms for Solving Zero-Sum Stochastic Games (Q4991675) (← links)
- Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles (Q5286059) (← links)
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields (Q5418498) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)
- On the separation of the roots of the generalized Fibonacci polynomial (Q6130561) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)
