9842 search results - page 180 / 1969 » Problem complexity |
110
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
114
click to vote
CASC
2009
Springer
15 years 9 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
142
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
127
click to vote
DLT
2009
15 years 4 days ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
126
click to vote
ECCC
2008
15 years 2 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...