On the complexity of computing a random Boolean function over the reals (Q5140843)
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 7286919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing a random Boolean function over the reals |
scientific article; zbMATH DE number 7286919 |
Statements
17 December 2020
0 references
complexity theory
0 references
lower bounds
0 references
average case
0 references
formula complexity
0 references
random Boolean function
0 references
quantifier elimination
0 references
0.7872243523597717
0 references
0.7852399349212646
0 references
0.7779147028923035
0 references
0.7749760150909424
0 references
0.7738566398620605
0 references
