{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:13:30Z","timestamp":1648538010824},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1016\/j.ipl.2015.08.004","type":"journal-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T17:45:43Z","timestamp":1439401543000},"page":"179-182","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["VNP<\/mml:mi><\/mml:mrow>=<\/mml:mo>VP<\/mml:mi><\/mml:mrow><\/mml:math> in the multilinear world"],"prefix":"10.1016","volume":"116","author":[{"given":"Meena","family":"Mahajan","sequence":"first","affiliation":[]},{"given":"Nitin","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tavenas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2015.08.004_br0010","series-title":"Symposium on Theory of Computing","first-page":"249","article-title":"Completeness classes in algebra","author":"Valiant","year":"1979"},{"key":"10.1016\/j.ipl.2015.08.004_br0020","series-title":"Logic and Algorithmic: International Symposium in Honour of Ernst Specker","first-page":"365","article-title":"Reducibility by algebraic projections","volume":"vol. 30","author":"Valiant","year":"1982"},{"issue":"3\u20134","key":"10.1016\/j.ipl.2015.08.004_br0030","first-page":"207","article-title":"Arithmetic circuits: a survey of recent results and open questions","volume":"5","author":"Shpilka","year":"2010","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2015.08.004_br0040","series-title":"Perspectives in Computational Complexity","first-page":"51","article-title":"Algebraic complexity classes","volume":"vol. 26","author":"Mahajan","year":"2014"},{"issue":"3","key":"10.1016\/j.ipl.2015.08.004_br0050","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s00037-013-0072-x","article-title":"Resource trade-offs in syntactically multilinear arithmetic circuits","volume":"22","author":"Jansen","year":"2013","journal-title":"Comput. Complex."},{"issue":"1","key":"10.1016\/j.ipl.2015.08.004_br0060","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jco.2006.09.006","article-title":"Characterizing Valiant's algebraic complexity classes","volume":"24","author":"Malod","year":"2008","journal-title":"J. Complex."},{"key":"10.1016\/j.ipl.2015.08.004_br0070","series-title":"Mathematical Foundations of Computer Science 2008","first-page":"455","article-title":"Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae","volume":"vol. 5162","author":"Mahajan","year":"2008"},{"key":"10.1016\/j.ipl.2015.08.004_br0080","series-title":"Computer Science \u2013 Theory and Applications","first-page":"179","article-title":"Simulation of arithmetical circuits by branching programs with preservation of constant width and syntactic multilinearity","volume":"vol. 5675","author":"Jansen","year":"2009"},{"issue":"1","key":"10.1016\/j.ipl.2015.08.004_br0090","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s00037-009-0263-7","article-title":"The black-box query complexity of polynomial summation","volume":"18","author":"Juma","year":"2009","journal-title":"Comput. Complex."},{"issue":"6","key":"10.1016\/j.ipl.2015.08.004_br0100","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4086\/toc.2006.v002a006","article-title":"Separation of multilinear circuit and formula size","volume":"2","author":"Raz","year":"2006","journal-title":"Theory Comput."},{"key":"10.1016\/j.ipl.2015.08.004_br0110","series-title":"Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing","first-page":"615","article-title":"Separating multilinear branching programs and formulas","author":"Dvir","year":"2012"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019015001416?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019015001416?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T19:28:32Z","timestamp":1617478112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019015001416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["S0020019015001416"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2015.08.004","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2016,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"in the multilinear world","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2015.08.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}