Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482)
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: Almost all monotone Boolean functions are polynomially learnable using membership queries |
scientific article; zbMATH DE number 1767381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost all monotone Boolean functions are polynomially learnable using membership queries |
scientific article; zbMATH DE number 1767381 |
Statements
Almost all monotone Boolean functions are polynomially learnable using membership queries (English)
0 references
14 July 2002
0 references
Monotone Boolean function
0 references
Learning
0 references
Membership query
0 references
Computational complexity
0 references
0 references
0 references
