A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates (Q6568352)
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: A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates |
scientific article; zbMATH DE number 7877660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates |
scientific article; zbMATH DE number 7877660 |
Statements
A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates (English)
0 references
5 July 2024
0 references
formula complexity
0 references
communication complexity
0 references
Karchmer-Raz-Wigderson conjecture
0 references
De Morgan formulas
0 references
