Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Entropy of operators or why matrix multiplication is hard for depth-two circuits |
scientific article; zbMATH DE number 5706004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Entropy of operators or why matrix multiplication is hard for depth-two circuits |
scientific article; zbMATH DE number 5706004 |
Statements
Entropy of operators or why matrix multiplication is hard for depth-two circuits (English)
0 references
10 May 2010
0 references
boolean circuits
0 references
bilinear forms
0 references
matrix multiplication
0 references
entropy
0 references
0 references
0 references
0.8578843
0 references
0.85558015
0 references
0.8492668
0 references
0.8435847
0 references
0.8394231
0 references
0.8391189
0 references
0.8352495
0 references
