The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis |
scientific article |
Statements
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (English)
0 references
6 August 2009
0 references
Boolean circuit
0 references
Post's lattice
0 references
clones
0 references
membership problem
0 references
computational complexity
0 references
