Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems
Polyhedral and Algebraic Methods in Computational Geometry
โ Scribed by Joswig, Michael;Theobald, Thorsten
- Publisher
- Springer London
- Year
- 2013
- Tongue
- English
- Series
- Universitext
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Subjects
Algebra--Data processing;Mathematics;Algorithms;Computer science;Discrete groups;Geometry;Algebra -- Data processing
๐ SIMILAR VOLUMES
Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problem
The interplay between computation and many areas of algebra is a natural phenomenon in view of the algorithmic character of the latter. The existence of inexpensive but powerful computational resources has enhanced these links by the opening up of many new areas of investigation in algebra.
<P>From the reviews: </P> <P>"... Many parts of the book can be read by anyone with a basic abstract algebra course... it was one of the author's intentions to equip students who are interested in computational problems with the necessary algebraic background in pure mathematics and to encourage the
This publication gives a good insight in the interplay between commutative and non-commutative algebraic geometry. The theoretical and computational aspects are the central theme in this study. The topic is looked at from different perspectives in over 20 lecture reports. It emphasizes the current t