2168 search results - page 63 / 434 » Randomized Algorithms and Complexity Theory |
117
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
159
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
106
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
104
click to vote
KES
1998
Springer
15 years 7 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
123
click to vote
CSL
2005
Springer
15 years 8 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...