Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> (Q4210096)
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: Monotone Circuits for Connectivity Have Depth (log n)2-o(1) |
scientific article; zbMATH DE number 1200728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9534477591514589
0 references
0.8330743312835693
0 references
0.8329602479934692
0 references
0.8298690915107727
0 references
