# Descartes' rule of signs

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- 2017

What can we deduce about the roots of a real polynomial in one variable by simply considering the signs of its coefficients? On… (More)

Is this relevant?

2016

2016

- ArXiv
- 2016

We give the first multivariate version of Descartes’ rule of signs to bound the number of positive real roots of a system of… (More)

Is this relevant?

2015

2015

- Archive of Formal Proofs
- 2015

In this work, we formally proved Descartes Rule of Signs, which relates the number of positive real roots of a polynomial with… (More)

Is this relevant?

2013

2013

- ArXiv
- 2013

Computing the real roots of a polynomial is a fundamental problem of computational algebra. We describe a variant of the… (More)

Is this relevant?

2010

2010

- 2010

A slightly different question is how many positive zeros a polynomial has. Here the basic result is known as “Descartes’ rule of… (More)

Is this relevant?

2004

2004

- The American Mathematical Monthly
- 2004

The question of how to construct polynomials having as many roots as allowed by the Descartes rule of signs has been the focus of… (More)

Is this relevant?

2004

2004

- computational complexity
- 2004

A real polynomial P(X 1, ... , X n ) sign represents f : A n → {0, 1} if for every (a 1, ... , a n ) ∈ A n , the sign of P(a 1… (More)

Is this relevant?

2002

2002

- Neural Computation
- 2002

We establish versions of Descartes' rule of signs for radial basis function (RBF) neural networks. The RBF rules of signs provide… (More)

Is this relevant?

2002

2002

- ALT
- 2002

We establish versions of Descartes' rule of signs for radial basis function (RBF) neural networks. These RBF rules of signs… (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- SYMSACC
- 1976

Uspensky's 1948 book on the theory of equations presents an algorithm, based on Descartes' rule of signs, for isolating the real… (More)

Is this relevant?