Space pseudorandom generators by communication complexity lower bounds (Q2969656)
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 6696539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space pseudorandom generators by communication complexity lower bounds |
scientific article; zbMATH DE number 6696539 |
Statements
22 March 2017
0 references
communication complexity
0 references
logspace
0 references
pseudorandom generator
0 references
0.8132191896438599
0 references
0.8125422596931458
0 references
0.8040443062782288
0 references
0.8040443062782288
0 references
0.779800534248352
0 references
