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 this page instead for the normal view: Minimizing the average query complexity of learning monotone Boolean functions |
scientific article; zbMATH DE number 6039079
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
