On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927)
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: On the complexity of computing bilinear forms with \(\{0,1\}\) constants |
scientific article; zbMATH DE number 3694583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing bilinear forms with \(\{0,1\}\) constants |
scientific article; zbMATH DE number 3694583 |
Statements
On the complexity of computing bilinear forms with \(\{0,1\}\) constants (English)
0 references
1980
0 references
arithmetic complexity
0 references
multiplicative complexity
0 references
bilinear forms
0 references
bilinear programs
0 references
NP-complete
0 references
additions
0 references
