Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221)
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: Complexity classifications for different equivalence and audit problems for Boolean circuits |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7907469868659973
0 references
0.7804803848266602
0 references
0.7774116396903992
0 references
0.750891387462616
0 references
