Computational Complexity of Fixed Points and Intersection Points

Abstract

AbstractWe study the computational complexity of Brouwer′s fixed point theorem and the intersection point theorem in the two-dimensional case. Papadimitriou (1990, in "Proceedings, 31st IEEE Sympos. Found. Comput. Sci.," pp. 794-801) defined a complexity class PDLF to characterize the complexity of the fixed point theorem in the three-dimensional case. We define a subclass PMLF of PDLF and show that the fixed points and the intersection points of polynomial-time computable functions are not polynomial-time computable if PMLF contains a function on unary inputs that is not polynomial-time computable