388 search results - page 40 / 78 » Robust Lower Bounds for Communication and Stream Computation |
163
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
156
click to vote
FOCS
2008
IEEE
16 years 16 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
161
click to vote
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
172
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
152
click to vote
EMSOFT
2007
Springer
16 years 7 days ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...