{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:07:19Z","timestamp":1648656439981},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1981,10,1]],"date-time":"1981-10-01T00:00:00Z","timestamp":370742400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1981,10]]},"DOI":"10.1016\/0020-0190(81)90017-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"217-220","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of simplifying quadratic forms"],"prefix":"10.1016","volume":"12","author":[{"given":"M.","family":"Snir","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90017-X_BIB1","series-title":"The Computational Complexity of Algebraic and Numerical Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0020-0190(81)90017-X_BIB2","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(81)90017-X_BIB3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0022-0000(80)90006-9","article-title":"On the complexity of computer bilinear forms with {0, 1} constants","volume":"20","author":"Gonzalez","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0020-0190(81)90017-X_BIB4","series-title":"Analysis of Numerical Methods","author":"Isaacson","year":"1966"},{"key":"10.1016\/0020-0190(81)90017-X_BIB5","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(81)90017-X_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/SWAT.1972.29","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972","journal-title":"Proc. 13th Annual Symp. on Switching and Automata Theory"},{"key":"10.1016\/0020-0190(81)90017-X_BIB7","series-title":"Ph.D. Thesis","article-title":"Depth complexity of formulas","author":"Snir","year":"1979"},{"key":"10.1016\/0020-0190(81)90017-X_BIB8","series-title":"Complexity of Computer Computations","first-page":"1","article-title":"Evaluation of rational functions","author":"Strassen","year":"1972"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908190017X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908190017X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:52:47Z","timestamp":1555087967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908190017X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1981,10]]}},"alternative-id":["002001908190017X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90017-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,10]]}}}