Testing degenerate polynomials
From MaRDI portal
Recommendations
- Counting degenerate polynomials of fixed degree and bounded height
- Computers and the Multiplicity of Polynomial Roots
- scientific article; zbMATH DE number 1254237
- Efficient algorithms for sparse cyclotomic integer zero testing
- On the number of integer polynomials with multiplicatively dependent roots
Cites work
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1996322 (Why is no real title available?)
- scientific article; zbMATH DE number 3346453 (Why is no real title available?)
- Additive and multiplicative relations connecting conjugate algebraic numbers
- Computing the measure of a polynomial
- Conjugate algebraic numbers on conics
- Deux propriétés décidables des suites récurrentes linéaires
- Irreducible polynomials with many roots of equal modulus
- Irreducible polynomials with many roots of maximal modulus
- On Robin's criterion for the Riemann hypothesis
- Unimodular integer circulants
Cited in
(6)- Counting degenerate polynomials of fixed degree and bounded height
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- scientific article; zbMATH DE number 2219805 (Why is no real title available?)
- Testing Low Degree Trigonometric Polynomials
- The number of roots of a lacunary bivariate polynomial on a line
- Test polynomials
This page was built for publication: Testing degenerate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429757)