Monotone Circuits for Connectivity Require Super-Logarithmic Depth (Q3472058)
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 Require Super-Logarithmic Depth |
scientific article; zbMATH DE number 4139682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotone Circuits for Connectivity Require Super-Logarithmic Depth |
scientific article; zbMATH DE number 4139682 |
Statements
Monotone Circuits for Connectivity Require Super-Logarithmic Depth (English)
0 references
1990
0 references
circuit complexity
0 references
graph connectivity
0 references
complexity of Boolean functions
0 references
monotone circuit
0 references
undirected graph
0 references
communication complexity
0 references
0.9534477591514589
0 references
0.9534477591514589
0 references
0.8296030163764954
0 references
0.8293794989585876
0 references
