A Sperner lemma complete for PPA
type: Item
instance of: scholarly article
title: A Sperner lemma complete for PPA
zbMATH Open document ID: 0996.68082
DOI: 10.1016/S0020-0190(00)00152-6
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1767244
zbMATH Keywords: theory of computation
zbMATH Keywords: formal languages
author: Michelangelo Grigni
MaRDI profile type: Publication
Wikidata QID: Q125059452
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: How easy is local search?
cites work: On total functions, existence theorems and computational complexity
cites work: The relative complexity of NP search problems
cites work: Q3994730
Recommended article: \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma
Recommended article: Q3782440
Recommended article: Logical Approaches to Computational Barriers
Recommended article: A short proof of Sperner's lemma
Recommended article: Discrete versions of the KKM lemma and their PPAD-completeness
Recommended article: Classroom Notes
Recommended article: A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
Recommended article: Q3382936
Recommended article: A Sperner-type theorem
Recommended article: A constructive proof of a permutation-based generalization of Sperner's lemma
description: scientific article; zbMATH DE number 1767244