An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s000370050010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1524291506 / rank | |||
Normal rank |
Latest revision as of 02:49, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exponential lower bound on the size of algebraic decision trees for MAX |
scientific article |
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