The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Sur la complexité de certains algorithmes où intervient la séparation des racines d'un polynôme”

Note sur les relations entre les racines d'un polynôme réductible

Sébastien Orange, Guenaël Renault, Annick Valibouze (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Dans cet article, nous exploitons la réductibilité d'un polynôme d'une variable pour calculer efficacement l'idéal des relations algébriques entre ses racines.