Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q623503 |
||
| Property / author | |||
| Property / author: Alexander A. Sherstov / rank | |||
Revision as of 01:11, 20 February 2024
scientific article; zbMATH DE number 6974574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the Minsky--Papert Barrier for Constant-Depth Circuits |
scientific article; zbMATH DE number 6974574 |
Statements
Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (English)
0 references
7 November 2018
0 references
polynomial representations of Boolean functions
0 references
polynomial threshold functions
0 references
threshold degree
0 references
computational learning theory
0 references
communication complexity theory
0 references
polynomial approximation theory
0 references
