The complexity of constructing pseudorandom generators from hard functions (Q1766819)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of constructing pseudorandom generators from hard functions |
scientific article; zbMATH DE number 2140065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of constructing pseudorandom generators from hard functions |
scientific article; zbMATH DE number 2140065 |
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
0.8298074007034302
0 references
0.8298074007034302
0 references
0.8265095353126526
0 references
0.8242587447166443
0 references
0.8230994343757629
0 references
