On the complexity of computing bilinear forms with {0, 1} constants
- 1 February 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 20 (1) , 77-95
- https://doi.org/10.1016/0022-0000(80)90006-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969