1449 search results - page 59 / 290 » Self-Randomized Exponentiation Algorithms |
106
Voted
FOCS
1990
IEEE
15 years 4 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
99
Voted
UAI
2008
15 years 2 months ago
2008
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
FOCM
2008
15 years 19 days ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
73
Voted
IANDC
2010
14 years 11 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...