5608 search results - page 980 / 1122 » On the Theory of Matchgate Computations |
213
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
101
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
125
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
106
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
125
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...