On the computational complexity of some classical equivalence relations on boolean functions (Q1272598)
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: On the computational complexity of some classical equivalence relations on boolean functions |
scientific article; zbMATH DE number 1234634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of some classical equivalence relations on boolean functions |
scientific article; zbMATH DE number 1234634 |
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
0.9256736
0 references
0.91830426
0 references
0.91795284
0 references
0 references
0 references
0 references
0.9053874
0 references
