On the randomness complexity of efficient sampling (Q2931431)
From MaRDI portal
!
WARNING
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 6373943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the randomness complexity of efficient sampling |
scientific article; zbMATH DE number 6373943 |
Statements
On the randomness complexity of efficient sampling (English)
0 references
25 November 2014
0 references
compression
0 references
derandomization
0 references
information-theoretic cryptography
0 references
pseudorandom generators
0 references
randomness complexity
0 references
secure computation
0 references
0.9345046
0 references
0.92691135
0 references
0 references
0.89556617
0 references
0 references
0.8891586
0 references
0.88488764
0 references
