{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T22:25:39Z","timestamp":1780525539714,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035776","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"451-460","source":"Crossref","is-referenced-by-count":37,"title":["Tensor rank is NP-complete"],"prefix":"10.1007","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(81)90070-0","volume":"15","author":"A. Alder","year":"1981","unstructured":"Alder A. and Strassen V. \u201cOn the Algorithmic Complexity of Associative Algebras\u201d, Theoretical Computer Science 15 (1981), pp 201\u2013211.","journal-title":"Theoretical Computer Science"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bshouty N.H. \u201cA Lower Bound for Matrix Multiplication\u201d, Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp 64\u201367.","DOI":"10.1109\/SFCS.1988.21922"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Cook S.A. \u201cOn the Complexity of Theorem Proving Procedures\u201d, Proceedings 3rd Annual ACM Symposium on the Theory of Computing, pp 151\u2013159.","DOI":"10.1145\/800157.805047"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Coppersmith D. and Winograd S., \u201cMatrix Multiplication via Arithmetic Progressions\u201d, Proceedings 19th Annual ACM Symposium on the Theory of Computing, pp 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"29_CR5","unstructured":"Garey M. R. and Johnson D.S., \u201cComputers and Intractability\u201d, W.H. Freeman and Company, 1979."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0022-0000(80)90006-9","volume":"20","author":"T. Gonzalez","year":"1980","unstructured":"Gonzalez T. and Ja'Ja' J. \u201cOn the Complexity of Computing Bilinear Forms with {0, 1} Constants\u201d, Journal of Computer and Systems Sciences\n20, (1980) pp 77\u201395.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"29_CR7","unstructured":"Strassen V. \u201cThe asymptotic spectrum of tensors\u201d, manuscript, 1986."},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0024-3795(83)80041-X","volume":"52\/53","author":"V. Strassen","year":"1983","unstructured":"Strassen V. \u201cRank and Optimal Computation of Generic Tensors\u201d, Linear Algebra and its applications 52\/53 (1983), pp 645\u2013685.","journal-title":"Linear Algebra and its applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T05:30:53Z","timestamp":1549431053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0035776","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}