Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:53, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity classifications for different equivalence and audit problems for Boolean circuits |
scientific article |
Statements
Complexity classifications for different equivalence and audit problems for Boolean circuits (English)
0 references
22 October 2012
0 references
Boolean circuits
0 references
complexity classification
0 references
isomorphism
0 references
