The complexity of DNF of parities (Q2800552)
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 DNF of parities |
scientific article; zbMATH DE number 6569685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of DNF of parities |
scientific article; zbMATH DE number 6569685 |
Statements
15 April 2016
0 references
affine disperser
0 references
affine extractors
0 references
DNF
0 references
The complexity of DNF of parities (English)
0 references
0.7834054231643677
0 references
0.7612611651420593
0 references
0.7601248025894165
0 references
0.7575541138648987
0 references
