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.
The Complexity of Yamnitsky and Levin’s Simplices Algorithm
Polytopes — Combinatorics and Computation
Birkhäuser Basel, January 2000
Sven G. Bartels
Gil Kalai, Günter M. Ziegler
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.
|Readers by professional status||Count||As %|
|Lecturer > Senior Lecturer||1||50%|
|Readers by discipline||Count||As %|