Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees (Q6499273)
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 7844639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees |
scientific article; zbMATH DE number 7844639 |
Statements
Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees (English)
0 references
8 May 2024
0 references
AND-OR trees
0 references
circuit lower bounds
0 references
random projections
0 references
threshold circuits
0 references
0 references
0 references
0 references
