Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes

Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF (2006) Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes. Lecture Notes in Computer Science, 3998. pp. 380-391.

[img] Text
11758471_36 - Published Version
Restricted to Registered users only

Download (39kB)

Abstract

In this paper, we define three Sperner problems on specific surfaces and prove that they are complete respectively for the classes PPAD, PPADS and PPA. This is the first time that locally 2-dimensional Sperner problems are proved to be complete for any of the polynomial parity argument classes. Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (Eds.): CIAC 2006. 6th Italian conference on algorithms and complexity. Rome, 2006. Berlin, Springer, 2006.

Item Type: ISI Article
Uncontrolled Keywords: Sperner's Lemma, parity argument classes
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:27
Last Modified: 11 Dec 2012 15:27
URI: http://eprints.sztaki.hu/id/eprint/4727

Update Item Update Item