STOC
2002
ACM
14 years 12 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM