29908 search results - page 376 / 5982 » On the complexity of communication complexity |
164
click to vote
ALT
2005
Springer
16 years 3 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
181
click to vote
ISPASS
2010
IEEE
16 years 1 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
172
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
154
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We show a range of complexity results for the Ricardo and Heckscher-Ohlin models of international trade (as Arrow-Debreu production markets). For both models, we show three types o...
154
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...