4 search results - page 1 / 1 » NP search problems in low fragments of bounded arithmetic |
JSYML
2007
13 years 10 months ago
2007
APAL
2011
13 years 5 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
SIAMCOMP
2010
13 years 9 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...