Combinatorics and Convexity

Gil Kalai ()
Additional contact information
Gil Kalai: Hebrew University Givat Ram

A chapter in Proceedings of the International Congress of Mathematicians, 1995, pp 1363-1374 from Springer

Abstract: Abstract Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski, and Steinitz. The theory was advanced greatly since the 1950’s and was influenced by the discovery of the simplex algorithm, the connections with extremal combinatorics, the introduction of methods from commutative algebra, and the relations with complexity theory

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9078-6_131

Ordering information: This item can be ordered from
http://www.springer.com/9783034890786

DOI: 10.1007/978-3-0348-9078-6_131

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().