乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T18:00:40Z","timestamp":1720893640622},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1016\/j.jco.2016.10.001","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T15:50:43Z","timestamp":1476805843000},"page":"38-50","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Lower bounds by Birkhoff interpolation"],"prefix":"10.1016","volume":"39","author":[{"given":"Ignacio","family":"Garc\u00eda-Marco","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jco.2016.10.001_br000005","doi-asserted-by":"crossref","unstructured":"M. Agrawal, V. Vinay, Arithmetic circuits: A chasm at depth four, in: Proc. 49th IEEE Symposium on Foundations of Computer Science, 2008, pp. 67\u201375.","DOI":"10.1109\/FOCS.2008.32"},{"issue":"2","key":"10.1016\/j.jco.2016.10.001_br000010","first-page":"201","article-title":"Polynomial interpolation in several variables","volume":"4","author":"Alexander","year":"1995","journal-title":"J. Algebraic Geom."},{"issue":"2","key":"10.1016\/j.jco.2016.10.001_br000015","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0706021","article-title":"A partial characterization of poised Hermite\u2013Birkhoff interpolation problems","volume":"6","author":"Atkinson","year":"1969","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"10.1016\/j.jco.2016.10.001_br000020","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.jpaa.2007.09.014","article-title":"On the Alexander\u2013Hirschowitz theorem","volume":"212","author":"Brambilla","year":"2008","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/j.jco.2016.10.001_br000025","series-title":"Condition: The Geometry of Numerical Algorithms","volume":"vol. 349","author":"B\u00fcrgisser","year":"2013"},{"key":"10.1016\/j.jco.2016.10.001_br000030","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.jalgebra.2012.07.028","article-title":"The solution to the Waring problem for monomials and the sum of coprime monomials","volume":"370","author":"Carlini","year":"2012","journal-title":"J. Algebra"},{"key":"10.1016\/j.jco.2016.10.001_br000035","doi-asserted-by":"crossref","unstructured":"K. Efremenko, J.M. Landsberg, H. Schenck, J. Weyman, The method of shifted partial derivatives cannot separate the permanent from the determinant, 2016. arXiv preprint arXiv:1609.02103 \u00a0[math.AG].","DOI":"10.1090\/mcom\/3284"},{"key":"10.1016\/j.jco.2016.10.001_br000040","series-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing","first-page":"128","article-title":"Lower bounds for depth 4 formulas computing iterated matrix multiplication","author":"Fournier","year":"2014"},{"key":"10.1016\/j.jco.2016.10.001_br000045","doi-asserted-by":"crossref","unstructured":"A. Gupta, P. Kamath, N. Kayal, R. Saptharishi, Approaching the chasm at depth four, in: Proceedings of the 2013 IEEE Conference on Computational Complexity (CCC), 2013, pp. 65\u201373.","DOI":"10.1109\/CCC.2013.16"},{"key":"10.1016\/j.jco.2016.10.001_br000050","doi-asserted-by":"crossref","unstructured":"A. Gupta, P. Kamath, N. Kayal, R. Saptharishi, Arithmetic circuits: A chasm at depth three, in: Proc. 54th IEEE Symposium of Foundations of Computer Science (FOCS), 2013, pp. 578\u2013587.","DOI":"10.1109\/FOCS.2013.68"},{"key":"10.1016\/j.jco.2016.10.001_br000055","unstructured":"N. Kayal, An exponential lower bound for the sum of powers of bounded degree polynomials, in: Electronic Colloquium on Computational Complexity (ECCC), 19, 2012."},{"key":"10.1016\/j.jco.2016.10.001_br000060","series-title":"Proc. 42nd International Colloquium on Automata, Languages and Programming (ICALP 2015), Part I","first-page":"810","article-title":"Lower bounds for sums of powers of low degree univariates","volume":"vol. 9134","author":"Kayal","year":"2015"},{"key":"10.1016\/j.jco.2016.10.001_br000065","series-title":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"61","article-title":"An exponential lower bound for homogeneous depth four arithmetic formulas","author":"Kayal","year":"2014"},{"key":"10.1016\/j.jco.2016.10.001_br000070","series-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing","first-page":"146","author":"Kayal","year":"2014"},{"key":"10.1016\/j.jco.2016.10.001_br000075","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.tcs.2012.03.041","article-title":"Arithmetic circuits: the chasm at depth four gets wider","volume":"448","author":"Koiran","year":"2012","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.jco.2016.10.001_br000080","series-title":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"364","article-title":"On the power of homogeneous depth 4 arithmetic circuits","author":"Kumar","year":"2014"},{"key":"10.1016\/j.jco.2016.10.001_br000085","series-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing","first-page":"136","article-title":"The limits of depth reduction for arithmetic formulas: It\u2019s all about the top fan-in","author":"Kumar","year":"2014"},{"issue":"3","key":"10.1016\/j.jco.2016.10.001_br000090","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10208-009-9055-3","article-title":"On the ranks and border ranks of symmetric tensors","volume":"10","author":"Landsberg","year":"2010","journal-title":"Found. Comput. Math."},{"key":"10.1016\/j.jco.2016.10.001_br000095","series-title":"Birkhoff Interpolation","volume":"vol. 19","author":"Lorentz","year":"1984"},{"key":"10.1016\/j.jco.2016.10.001_br000100","doi-asserted-by":"crossref","unstructured":"S. Tavenas, Improved bounds for reduction to depth 4 and depth 3, in: Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2013.","DOI":"10.1007\/978-3-642-40313-2_71"},{"key":"10.1016\/j.jco.2016.10.001_br000105","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Completeness classes in algebra, in: Proc. 11th ACM Symposium on Theory of Computing, 1979, pp. 249\u2013261.","DOI":"10.1145\/800135.804419"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16300772?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X16300772?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T13:37:05Z","timestamp":1617370625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X16300772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":21,"alternative-id":["S0885064X16300772"],"URL":"https:\/\/doi.org\/10.1016\/j.jco.2016.10.001","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lower bounds by Birkhoff interpolation","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jco.2016.10.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}