A note on computational indistinguishability (Q910218)
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 4139291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on computational indistinguishability |
scientific article; zbMATH DE number 4139291 |
Statements
A note on computational indistinguishability (English)
0 references
1990
0 references
computational complexity
0 references
analysis of algorithms
0 references
randomness
0 references
0 references
0.9026336
0 references
0.8872295
0 references
0.88165176
0 references
0.87832314
0 references
0.8715251
0 references
0.8689545
0 references
0.86796224
0 references
