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...
Κύριοι συγγραφείς: | , , |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2006.
|
Έκδοση: | Second Edition. |
Σειρά: | Algorithms and Computation in Mathematics,
10 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.