On the computational complexity of some classical equivalence relations on boolean functions (Q1272598)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of some classical equivalence relations on boolean functions |
scientific article |
Statements
On the computational complexity of some classical equivalence relations on boolean functions (English)
0 references
3 January 1999
0 references
computational complexity
0 references
