165 search results - page 14 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
142
click to vote
SIAMCOMP
2010
14 years 10 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...
106
Voted
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
107
Voted
FOCS
2007
IEEE
15 years 6 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...
AAAI
2006
15 years 1 months ago
2006
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...