Breaking the Minsky-Papert barrier for constant-depth circuits (Q5259556)
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 6451550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the Minsky-Papert barrier for constant-depth circuits |
scientific article; zbMATH DE number 6451550 |
Statements
Breaking the minsky-papert barrier for constant-depth circuits (English)
0 references
26 June 2015
0 references
communication complexity
0 references
computational learning theory
0 references
polynomial approximation
0 references
polynomial representations of Boolean functions
0 references
polynomial threshold functions
0 references
0 references
0 references
0.9943335056304932
0 references
0.8861989974975586
0 references
0.8269497752189636
0 references
0.8235083818435669
0 references
0.8161256909370422
0 references
