207 search results - page 34 / 42 » The Polynomial Method for Random Matrices |
TIT
2010
13 years 2 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
JSC
2010
13 years 5 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
ALENEX
2010
13 years 8 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...