Query complexity of Boolean functions on slices (Q6418937)
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 7840561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query complexity of Boolean functions on slices |
scientific article; zbMATH DE number 7840561 |
Statements
29 November 2022
0 references
Query complexity of Boolean functions on slices (English)
0 references
0.8838617205619812
0 references
0.7523424029350281
0 references
0.7480515241622925
0 references
0.7461166977882385
0 references
