The complexity of constructing pseudorandom generators from hard functions (Q1766819): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:24, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of constructing pseudorandom generators from hard functions |
scientific article |
Statements
The complexity of constructing pseudorandom generators from hard functions (English)
0 references
1 March 2005
0 references
Pseudorandom generator
0 references
hardness
0 references
constant-depth circuit
0 references
noise sensitivity
0 references
