64 search results - page 7 / 13 » stoc 2001 |
STOC
2001
ACM
15 years 10 months ago
2001
ACM
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
STOC
2006
ACM
15 years 10 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...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...