2735 search results - page 49 / 547 » Comparing notions of randomness |
SIGACT
2010
13 years 7 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
—This paper provides a power-margin-based measure of the quality of computer-generated random variates having a distribution that derives from the multivariate Gaussian distribut...
ISSAC
1997
Springer
14 years 29 days ago
1997
Springer
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
WSFM
2007
Springer
14 years 2 months ago
2007
Springer
We present and compare existing formalisms that consider the control of Petri net process models in the area of business processes and web services. Control has the aim to force a ...