Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor (Q1014397)
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: Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor |
scientific article; zbMATH DE number 5547780
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor |
scientific article; zbMATH DE number 5547780 |
Statements
Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor (English)
0 references
28 April 2009
0 references
branching program
0 references
reduced error pruning
0 references
inapproximability
0 references
algorithms
0 references
0.90979713
0 references
0.8449534
0 references
0.8293725
0 references
0.8244393
0 references
0.8213203
0 references
