\(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma |
scientific article; zbMATH DE number 6247654
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma |
scientific article; zbMATH DE number 6247654 |
Statements
\(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (English)
0 references
17 January 2014
0 references
computational complexity
0 references
colouring of polyhedra
0 references
vertex cover
0 references
