A lower bound for the computational complexity of a set of disjunctives in a monotone basis (Q1147681)
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: A lower bound for the computational complexity of a set of disjunctives in a monotone basis |
scientific article; zbMATH DE number 3704500
| 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; zbMATH DE number 3704500 |
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
