On the computational power of Boolean decision lists (Q853647)
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: On the computational power of Boolean decision lists |
scientific article; zbMATH DE number 5073645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational power of Boolean decision lists |
scientific article; zbMATH DE number 5073645 |
Statements
On the computational power of Boolean decision lists (English)
0 references
17 November 2006
0 references
Decision lists
0 references
learnability
0 references
lower bounds
0 references
0.8988414
0 references
0.8880094
0 references
0.8614418
0 references
0.8581718
0 references
0.85460085
0 references
0.85357076
0 references
0.8526857
0 references
0.85107774
0 references
