207 search results - page 8 / 42 » The Polynomial Method for Random Matrices |
103
click to vote
JAT
2010
15 years 6 days ago
2010
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
114
click to vote
SDMW
2004
Springer
15 years 7 months ago
2004
Springer
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
99
Voted
SIAMSC
2008
15 years 1 months ago
2008
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
102
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
119
Voted
STOC
1998
ACM
15 years 6 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...