↓ Skip to main content

Polytopes — Combinatorics and Computation

Overview of attention for book
Attention for Chapter 10: The Complexity of Yamnitsky and Levin’s Simplices Algorithm
Altmetric Badge

Citations

dimensions_citation
12 Dimensions

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The Complexity of Yamnitsky and Levin’s Simplices Algorithm
Chapter number 10
Book title
Polytopes — Combinatorics and Computation
Published by
Birkhäuser Basel, January 2000
DOI 10.1007/978-3-0348-8438-9_10
Book ISBNs
978-3-76-436351-2, 978-3-03-488438-9
Authors

Sven G. Bartels

Editors

Gil Kalai, Günter M. Ziegler

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Lecturer > Senior Lecturer 1 50%
Professor 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Computer Science 1 50%