On the complexity of branching programs and decision trees for clique functions (Q3798243)
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: On the complexity of branching programs and decision trees for clique functions |
scientific article; zbMATH DE number 4064494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of branching programs and decision trees for clique functions |
scientific article; zbMATH DE number 4064494 |
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
0.8158005475997925
0 references
0.8154515624046326
0 references
