2479 search results - page 151 / 496 » Quantum complexity theory |
185
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
192
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
215
click to vote
EM
2010
15 years 6 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
201
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
215
Voted
FUN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...