Optimal decision trees and one-time-only branching programs for symmetric Boolean functions (Q3722429)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal decision trees and one-time-only branching programs for symmetric Boolean functions |
scientific article |
Statements
Optimal decision trees and one-time-only branching programs for symmetric Boolean functions (English)
0 references
1984
0 references
Combinational complexity
0 references
depth
0 references
exponential lower bound
0 references
decision tree complexity
0 references
one-time-only branching program complexity
0 references
quadratic lower bound
0 references
