Hochschulschrift
Real root isolation for exact and approximate polynomials using Descartes' rule of signs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2008
- Klassifikation
-
Informatik
- Schlagwort
-
Rechenzeit ; Genauigkeit
- Urheber
- URN
-
urn:nbn:de:bsz:291-scidok-32445
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Approximate Versus Exact Equilibria
One-exact approximate Pareto sets
One-exact approximate Pareto sets
Geometric optimization and querying : exact & approximate
Using chebyshev polynomials to approximate partial differential equations
Integrity Constraints Revisited: From Exact to Approximate Implication
NP-hard networking problems : exact and approximate algorithms
Approximate degree and quantum query lower bounds via dual polynomials
A Descartes algorithms for polynomials with bit stream coefficients
A descartes algorithm for polynomials with Bit-Stream coefficients
Exact and Approximate Forms of the Renormalization Group.by Wilson.
On approximate and exact null controllability of delay systems
Approximate Versus Exact Equilibria
One-exact approximate Pareto sets
One-exact approximate Pareto sets
Geometric optimization and querying : exact & approximate
Using chebyshev polynomials to approximate partial differential equations
Integrity Constraints Revisited: From Exact to Approximate Implication
NP-hard networking problems : exact and approximate algorithms
Approximate degree and quantum query lower bounds via dual polynomials
A Descartes algorithms for polynomials with bit stream coefficients
A descartes algorithm for polynomials with Bit-Stream coefficients
Exact and Approximate Forms of the Renormalization Group.by Wilson.
On approximate and exact null controllability of delay systems
Approximate Versus Exact Equilibria
One-exact approximate Pareto sets
One-exact approximate Pareto sets
Geometric optimization and querying : exact & approximate
Using chebyshev polynomials to approximate partial differential equations
Integrity Constraints Revisited: From Exact to Approximate Implication
NP-hard networking problems : exact and approximate algorithms
Approximate degree and quantum query lower bounds via dual polynomials
A Descartes algorithms for polynomials with bit stream coefficients
A descartes algorithm for polynomials with Bit-Stream coefficients
Exact and Approximate Forms of the Renormalization Group.by Wilson.