Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (Q4210096)
From MaRDI portal
scientific article; zbMATH DE number 1200728
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> |
scientific article; zbMATH DE number 1200728 |
Statements
Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (English)
0 references
20 September 1998
0 references
monotone circuits
0 references
circuit complexity
0 references
connectivity
0 references
lower bounds
0 references
