On the complexity of branching programs and decision trees for clique functions (Q3798243): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:09, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of branching programs and decision trees for clique functions |
scientific article |
Statements
On the complexity of branching programs and decision trees for clique functions (English)
0 references
1988
0 references
complexity hierarchies
0 references
clique functions
0 references
Boolean decision-tree
0 references
branching programs
0 references
polynomial lower bounds
0 references
sequences of Boolean functions
0 references
