Skip to Main content Skip to Navigation
Theses

Algebraic certificates for Budan's theorem

Abstract : In this work we present two algebraic certificates for Budan's theorem. Budan's theorem claims the following. Let R be an ordered field, f in R[X] of degree n and a,b in R with a0. The algorithm for our first certificate is based on the historical proof by Budan which uses only combinatorial arguments. It has a complexity exponential in the degree of f. The algorithm for the second certificate is based on mixed Taylor series and shows a smaller complexity: The main calculation is solving a linear system; this is polynomial in the degree of f.
Document type :
Theses
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00839189
Contributor : Abes Star :  Contact
Submitted on : Thursday, June 27, 2013 - 1:42:10 PM
Last modification on : Saturday, December 19, 2020 - 3:00:27 AM
Long-term archiving on: : Wednesday, April 5, 2017 - 4:21:27 AM

File

These_A_BEMBE_Omar_2011.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00839189, version 1

Citation

Daniel Bembé. Algebraic certificates for Budan's theorem. General Mathematics [math.GM]. Université de Franche-Comté, 2011. English. ⟨NNT : 2011BESA2022⟩. ⟨tel-00839189⟩

Share

Metrics

Record views

808

Files downloads

711