\(\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 the normal view instead:
scientific article; zbMATH DE number 6247654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8626532554626465
0 references
0.8563166260719299
0 references
0.8343806862831116
0 references
0.8238218426704407
0 references
0.821528971195221
0 references
