{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:00:03Z","timestamp":1786089603579,"version":"3.56.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0196-6774(90)90014-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"644-654","source":"Crossref","is-referenced-by-count":415,"title":["Tensor rank is NP-complete"],"prefix":"10.1016","volume":"11","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(90)90014-6_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","article-title":"On the algorithmic complexity of associative algebras","volume":"15","author":"Alder","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(90)90014-6_BIB2","series-title":"Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"64","article-title":"A lower bound for matrix multiplication","author":"Bshouty","year":"1988"},{"key":"10.1016\/0196-6774(90)90014-6_BIB3","doi-asserted-by":"crossref","unstructured":"S. A. Cook, On the complexity of theorem proving procedures, in \u201cProceedings, 3rd Annual ACM Symposium on the Theory of Computing\u201d, pp. 151\u2013159.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/0196-6774(90)90014-6_BIB4","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in \u201cProceedings, 19th Annual ACM Symposium on the Theory of Computing\u201d, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"10.1016\/0196-6774(90)90014-6_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(90)90014-6_BIB6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0022-0000(80)90006-9","article-title":"On the complexity of computing bilinear forms with {0,1} constants","volume":"20","author":"Gonzalez","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0196-6774(90)90014-6_BIB7","series-title":"Automata, Languages and Programming","first-page":"451","article-title":"Tensor rank is NP-complete","volume":"Vol. 372","author":"H\u00e5stad","year":"1989"},{"key":"10.1016\/0196-6774(90)90014-6_BIB8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0120004","article-title":"On minimizing the number of multiplications necessary for matrix multiplication","volume":"20","author":"Hopcroft","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0196-6774(90)90014-6_BIB9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1515\/crll.1988.384.102","article-title":"The asymptotic spectrum of tensors","volume":"384","author":"Strassen","year":"1988","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0196-6774(90)90014-6_BIB10","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0024-3795(83)80041-X","article-title":"Rank and optimal computation of generic tensors","volume":"52\/53","author":"Strassen","year":"1983","journal-title":"Linear Algebra Appl."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677490900146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:57Z","timestamp":1548744837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677490900146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0196677490900146"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(90)90014-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}