A relation between correctness and randomness in the computation of probabilistic algorithms (Q3345786)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A relation between correctness and randomness in the computation of probabilistic algorithms |
scientific article; zbMATH DE number 3880119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relation between correctness and randomness in the computation of probabilistic algorithms |
scientific article; zbMATH DE number 3880119 |
Statements
A relation between correctness and randomness in the computation of probabilistic algorithms (English)
0 references
1984
0 references
Kolmogorov's complexity
0 references
probabilistic algorithm
0 references
probabilistic primality tests
0 references
random strings
0 references
0.8928453
0 references
0.8912474
0 references
0.8871866
0 references
0.8819041
0 references
0.8810748
0 references
0.88049227
0 references
0.8776918
0 references
0.8776918
0 references
