The difficulty of reduced error pruning of leveled branching programs (Q596496)
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: The difficulty of reduced error pruning of leveled branching programs |
scientific article; zbMATH DE number 2085803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The difficulty of reduced error pruning of leveled branching programs |
scientific article; zbMATH DE number 2085803 |
Statements
The difficulty of reduced error pruning of leveled branching programs (English)
0 references
10 August 2004
0 references
concept learning
0 references
branching programs
0 references
reduced error pruning
0 references
NP-completeness
0 references
approximability
0 references
0.8827664256095886
0 references
0.8280779719352722
0 references
0.800801694393158
0 references
