Addition is exponentially harder than counting for shallow monotone circuits (Q4978062)
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: Addition is exponentially harder than counting for shallow monotone circuits |
scientific article; zbMATH DE number 6761893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Addition is exponentially harder than counting for shallow monotone circuits |
scientific article; zbMATH DE number 6761893 |
Statements
Addition is exponentially harder than counting for shallow monotone circuits (English)
0 references
17 August 2017
0 references
circuit complexity
0 references
monotone circuit
0 references
unweighted threshold gate
0 references
weighted threshold function
0 references
