The complexity of constructing pseudorandom generators from hard functions (Q1766819): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00037-004-0187-1 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00037-004-0187-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058859323 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00037-004-0187-1 / rank | |||
Normal rank | |||
Latest revision as of 09:43, 11 December 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
