Randomness and pseudo-randomness in discrete mathematics (Q4208482)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1195809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomness and pseudo-randomness in discrete mathematics |
scientific article; zbMATH DE number 1195809 |
Statements
9 March 1999
0 references
random structures
0 references
derandomization
0 references
deterministic algorithms
0 references
0.93909657
0 references
0 references
0.9230264
0 references
0 references
0.9169853
0 references
0 references
0.9100038
0 references
Randomness and pseudo-randomness in discrete mathematics (English)
0 references
A survey is given of two expanding areas of discrete mathematics: the use of probabilistic techniques for proving deterministic statements, and the use of randomized algorithms for finding efficient deterministic algorithms. For the entire collection see [Zbl 0893.00027].
0 references
