A query efficient non-adaptive long code test with perfect completeness (Q3588448)
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 5783937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A query efficient non-adaptive long code test with perfect completeness |
scientific article; zbMATH DE number 5783937 |
Statements
A Query Efficient Non-adaptive Long Code Test with Perfect Completeness (English)
0 references
10 September 2010
0 references
long code test
0 references
dictatorship test
0 references
influence of variables
0 references
amortized query complexity
0 references
0.9532223343849182
0 references
0.773177981376648
0 references
0.764904797077179
0 references
0.7465338706970215
0 references
0.7423967123031616
0 references
