3690 search results - page 529 / 738 » Computation with classical sequents |
174
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
161
click to vote
SIAMCOMP
2010
15 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
161
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
142
click to vote
POPL
2009
ACM
16 years 8 days ago
2009
ACM
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
137
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...