On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Matching algorithmic bounds for finding a Brouwer fixed point
Journal of the ACM (JACM)
On the complexity of 2D discrete fixed point problem
Theoretical Computer Science
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the complexity of 2d discrete fixed point problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Several new complexity classes of search problems that lie between the classes FP and FNP are defined. These classes are contained in the class TFNP of search problems that always have a solution. A problem in each of these new classes is defined in terms of an implicitly given, exponentially large graph, very much like PLS (polynomial local search). The existence of the solution sought is established by means of a simple graph-theoretic lemma with an inefficiently constructive proof. Several class containments and collapses, resulting in the two new classes PDLF contained in PLF are shown; the relation of either class of PLS is open. PLF contains several important problems for which no polynomial-time algorithm is presently known.