Improving \(3N\) circuit complexity lower bounds (Q6184294): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00037-023-00246-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00037-023-00246-9 / rank | |||
Normal rank | |||
Latest revision as of 05:25, 22 February 2025
scientific article; zbMATH DE number 7794297
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving \(3N\) circuit complexity lower bounds |
scientific article; zbMATH DE number 7794297 |
Statements
Improving \(3N\) circuit complexity lower bounds (English)
0 references
24 January 2024
0 references
Boolean circuits
0 references
lower bounds
0 references
dispersers
0 references
0 references
0 references
0 references
0 references
