A direct version of Shamir and Snir's lower bounds on monotone circuit depth (Q1318755): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the depth complexity of formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Negation can be exponentially powerful / rank | |||
Normal rank | |||
Latest revision as of 14:22, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct version of Shamir and Snir's lower bounds on monotone circuit depth |
scientific article |
Statements
A direct version of Shamir and Snir's lower bounds on monotone circuit depth (English)
0 references
5 April 1994
0 references
arithmetic circuits
0 references
formula depth
0 references
parallel algorithms
0 references
