Algorithms in real algebraic geometry
The algorithmic problems of real algebraic geometry such as real root counting, deciding the existence of solutions of systems of polynomial equations and inequalities, finding global maxima or deciding whether two points belong in the same connected component of a semi-algebraic set appear frequent...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edició: | 2nd edition. |
| Col·lecció: | Algorithms and Computation in Mathematics
10 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms in real algebraic geometry, Saugata Basu, Richard Pollack, Marie-Françoise Roy, 2nd ed., 2006, Berlin, Springer, 1 vol. (IX-662 p.), Algorithms and computation in mathematics, 978-3-540-33098-1 • Algorithms in Real Algebraic Geometry, Texte imprimé, 9783540821953 |
Taula de continguts:
- Algebraically Closed Fields Real Closed Fields Semi-Algebraic Sets Algebra Decomposition of Semi-Algebraic Sets Elements of Topology Quantitative Semi-algebraic Geometry Complexity of Basic Algorithms Cauchy Index and Applications Real Roots Cylindrical Decomposition Algorithm Polynomial System Solving Existential Theory of the Reals Quantifier Elimination Computing Roadmaps and Connected Components of Algebraic Sets Computing Roadmaps and Connected Components of Semi-algebraic Sets