Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Steffen Reith / rank | |||
| Property / author | |||
| Property / author: Steffen Reith / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1009.1208 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:29, 19 April 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
