Minimizing the average query complexity of learning monotone Boolean functions (Q2884531)
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 6039079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the average query complexity of learning monotone Boolean functions |
scientific article; zbMATH DE number 6039079 |
Statements
30 May 2012
0 references
artificial intelligence
0 references
branch and bound networks-graphs
0 references
matchings statistics
0 references
sampling
0 references
Minimizing the average query complexity of learning monotone Boolean functions (English)
0 references
0.8312780261039734
0 references
0.7993630766868591
0 references
0.7991628050804138
0 references
0.7964272499084473
0 references
