13603 search results - page 337 / 2721 » On the Computational Complexity of Cut-Reduction |
177
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
216
Voted
CISS
2008
IEEE
16 years 2 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
169
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
196
Voted
STACS
1993
Springer
15 years 11 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
169
click to vote
CIT
2006
Springer
15 years 11 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...