1092 search results - page 111 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
187
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
136
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
174
click to vote
GLVLSI
2010
IEEE
15 years 6 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
146
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
134
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...