An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095)
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: An exponential lower bound on the size of algebraic decision trees for MAX |
scientific article; zbMATH DE number 1247752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exponential lower bound on the size of algebraic decision trees for MAX |
scientific article; zbMATH DE number 1247752 |
Statements
An exponential lower bound on the size of algebraic decision trees for MAX (English)
0 references
2 February 1999
0 references
computational complexity
0 references
algebraic decision trees
0 references
lower bounds
0 references
MAX problem
0 references
hypergraphs
0 references
minimal cutsets
0 references
