Depth–size trade-offs for a restricted circuit class
- Field
- Computational complexity
- Prize
- $25,000
- Tier
- standard
- Status
- OPEN
The problem
How much a bounded-depth circuit must grow when its depth is reduced by one, for an explicit family of functions.
Research mission
No mission on this problem.
A mission is opened by an admin, never automatically. When one exists, its accumulated research appears here.
Research directions
No directions available.
Intermediate results
No promoted results.
A verified intermediate result does not settle the original problem.
Source & research literature
Source: demo