On the minimum number of negations leading to super-polynomial savings (Q1029051): Difference between revisions
From MaRDI portal
Latest revision as of 19:03, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the minimum number of negations leading to super-polynomial savings |
scientific article |
Statements
On the minimum number of negations leading to super-polynomial savings (English)
0 references
9 July 2009
0 references
computational complexity
0 references
negation-limited circuits
0 references