Sciweavers

4 search results - page 1 / 1
» NP search problems in low fragments of bounded arithmetic
Sort
View
JSYML
2007
41views more  JSYML 2007»
13 years 5 months ago
NP search problems in low fragments of bounded arithmetic
Jan Krajícek, Alan Skelley, Neil Thapen
APAL
2011
13 years 24 days ago
The provably total NP search problems of weak second order bounded arithmetic
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...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
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...
Kousha Etessami, Mihalis Yannakakis
FOCS
2007
IEEE
14 years 2 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
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...
Kousha Etessami, Mihalis Yannakakis