A lower bound for the computational complexity of a set of disjunctives in a monotone basis (Q1147681)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the computational complexity of a set of disjunctives in a monotone basis |
scientific article |
Statements
A lower bound for the computational complexity of a set of disjunctives in a monotone basis (English)
0 references
1981
0 references
disjuntives
0 references
monotone basis
0 references
circuit complexity
0 references
functional elements
0 references
monotone Boolean function
0 references
