Learning versus pseudorandom generators in constant parallel time (Q6610340)
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 7918391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning versus pseudorandom generators in constant parallel time |
scientific article; zbMATH DE number 7918391 |
Statements
Learning versus pseudorandom generators in constant parallel time (English)
0 references
25 September 2024
0 references
parallel cryptography
0 references
polynomial-stretch pseudorandom generators in NC\(^0\)
0 references
PAC learning
0 references
average-case complexity
0 references
fixed-parameter tractability
0 references
