A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7393745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem |
scientific article; zbMATH DE number 7393745 |
Statements
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (English)
0 references
10 September 2021
0 references
constant-depth circuits
0 references
coin problem
0 references
explicit constructions
0 references
combinatorial designs
0 references
Janson's inequality
0 references
multivariate polynomials
0 references
0 references
0.9945914149284364
0 references
0.7830461263656616
0 references
0.7673951983451843
0 references
0.7517175674438477
0 references
