Combinatorial Convexity and Algebraic Geometry 3AD83CNR2N
| URI | m2://res/3AD83CNR2N |
|---|---|
| Kind | monograph |
| Creators | Günter Ewald |
| Date | 1996 |
| MSC | 52-01, 52A37, 52B20, 14-01, 14M25 |
| Scope | in |
Expressions
e1: edition
| Language | en |
|---|---|
| Date | 1996 |
| Ids | DOI 10.1007/978-1-4612-4044-0, zbl 0869.52001, zbl_id 960150 |
- m1: print, Springer New York, 1996 (record). isbn 9781461284765, isbn 9781461240440
Relations
- part_of Graduate Texts in Mathematics
Cited by
- Combinatorial Algebraic Geometry: Levico Terme, Italy 2013, Editors: Sandra Di Rocco, Bernd Sturmfels
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- The Calabi–Yau Landscape: From Geometry, to Physics, to Machine Learning
- Lectures on Convex Geometry
- Lectures on Convex Geometry
- Arrangements, Local Systems and Singularities: CIMPA Summer School, Galatasaray University, Istanbul, 2007
Catalogue records
- springer-series: 10.1007/978-1-4612-4044-0 (work)
- zbmath_search: 960150 (work)