Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

54

Voted

CIE
2006
Springer

favoriteEmaildiscussreport

110views Applied Computing» more CIE 2006»

On the Complexity of the Sperner Lemma

15 years 1 months ago

On the Complexity of the Sperner Lemma

Download www.cs.swan.ac.uk

Stefan S. Dantchev

Real-time Traffic

Applied Computing | CIE 2006 |

claim paper

Related Content

» On the BlackBox Complexity of Sperners Lemma

» Polytopal complexes maps chain complexes and necklaces

» Quantum Separation of Local Search and Fixed Point Computation

» A Polytopal Generalization of Sperners Lemma

» Sperner labellings A combinatorial approach

» MultiplyRecursive Upper Bounds with Higmans Lemma

» Fractional Kernels in Digraphs

» The Complexity of Unique kSAT An Isolation Lemma for kCNFs

» Metrization Theorem for SpaceTimes From Urysohns Problem towards Physically Useful Constru...

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CIE
Authors	Stefan S. Dantchev

Comments (0)