{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:01Z","timestamp":1725456541746},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540115762"},{"type":"electronic","value":"9783540393085"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0012780","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"330-338","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A lower bound for the formula size of rational functions"],"prefix":"10.1007","author":[{"given":"K. A.","family":"Kalorkoti","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"issue":"No.4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"L. CSANKY. Fast parallel inversion algorithms. SIAM J. on Computing, Vol. 5, No. 4 (1976), 618\u2013623.","journal-title":"SIAM J. on Computing"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"L. HYAFIL. On the parallel evaluation of multivariate polynomials. Proc. Tenth ACM Symp. on Theory of Computing (1978), 193\u2013195.","DOI":"10.1145\/800133.804347"},{"issue":"No.4","key":"29_CR3","first-page":"781","volume":"171","author":"B.M. Kloss","year":"1966","unstructured":"B.M. KLOSS. Estimates of the complexity of solutions of systems of linear equations. Dokl. Akad. Nauk. SSSR, Vol. 171, No. 4 (1966), pp. 781\u2013783. Sov. Math. Dokl., Vol. 7, No. 6 (1966), pp. 1537\u20131540.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"issue":"No.4","key":"29_CR4","first-page":"765","volume":"169","author":"\u00e8.I. Ne\u010diporuk","year":"1966","unstructured":"\u00e8.I. NE\u010cIPORUK. A Boolean function. Dokl. Akad. Nauk. SSSR, Vol. 169, No. 4 (1966), pp. 765\u2013766. Sov. Math. Dokl., Vol. 7, No. 4 (1966), pp. 999\u20131000.","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"29_CR5","volume-title":"The complexity of computing","author":"J.E. Savage","year":"1976","unstructured":"J.E. SAVAGE. The complexity of computing. Wiley, New York (1976)."},{"key":"29_CR6","volume-title":"Commutative Algebra","author":"O. Zariski","year":"1958","unstructured":"O. ZARISKI and P. SAMUEL. Commutative Algebra. Van Nostrand, Princeton, N.J. (1958) (2 volumes)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:57:35Z","timestamp":1558256255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0012780","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}