13603 search results - page 333 / 2721 » On the Computational Complexity of Cut-Reduction |
172
Voted
ICALP
2009
Springer
16 years 7 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...
192
Voted
CASC
2009
Springer
16 years 2 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...
204
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper proposes a novel Texture Pattern Flow (TPF) for complex background modeling and motion detection. The Pattern Flow is proposed to encode the binary pattern changes amon...
215
Voted
ICS
2001
Tsinghua U.
15 years 12 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
187
Voted
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...