{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:56:12Z","timestamp":1743148572369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_8","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"95-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Expressive Power of Read-Once Determinants"],"prefix":"10.1007","author":[{"given":"N. R.","family":"Aravind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pushkar S.","family":"Joglekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Chen, X., Li, D.: A quadratic lower bound for the permanent and determinant problem over any characteristic $$\\ne 2$$. In: 40th Annual ACM Symposium on Theory of computing, pp. 491\u2013498 (2008)","DOI":"10.1145\/1374376.1374446"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0747-7171(87)80063-9","volume":"4","author":"J von zur Gathen","year":"1987","unstructured":"von zur Gathen, J.: Feasible arithmetic computations: valiant\u2019s hypothesis. J. Symbolic Comput. 4, 137\u2013172 (1987)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s004930070031","volume":"20","author":"F James","year":"2000","unstructured":"James, F.: Geelen an algebraic matching algorithm. Combinatorica 20(1), 61\u201370 (2000)","journal-title":"Combinatorica"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s002009900021","volume":"10","author":"D Grigoriev","year":"2000","unstructured":"Grigoriev, D., Razborov, A.A.: Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. Appl. Algebra Eng. Commun. Comput. 10(6), 465\u2013487 (2000)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"8","key":"8_CR5","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1137\/090781231","volume":"39","author":"G Ivanyos","year":"2010","unstructured":"Ivanyos, G., Karpinski, M., Saxena, N.: Deterministic polynomial time algorithms for matrix completion problems. SIAM J. Comput. 39(8), 3736\u20133751 (2010)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-03351-3_17","volume-title":"Computer Science - Theory and Applications","author":"M Jansen","year":"2009","unstructured":"Jansen, M.: Lower bounds for the determinantal complexity of explicit low degree polynomials. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 167\u2013178. Springer, Heidelberg (2009)"},{"key":"8_CR7","unstructured":"Jansen, M.J., Qiao, Y., Sarma, J.: Deterministic identity testing of read-once algebraic branching programs, Electron. Colloquium Comput. Complexity (ECCC), 17:84 (2010)"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874\u2013897 (1982)","journal-title":"J. ACM"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"4241","DOI":"10.1155\/S1073792804142566","volume":"2004","author":"T Mignon","year":"2004","unstructured":"Mignon, T., Ressayre, N.: A quadratic bound for the determinant and permanent problem. Int. Math. Res. Not. 2004, 4241\u20134253 (2004)","journal-title":"Int. Math. Res. Not."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Lower bounds for noncommutative computation. In: Proceedings of 23rd ACM Symposium on Theory of Computing, pp. 410\u2013418 (1991)","DOI":"10.1145\/103418.103462"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01294256","volume":"6","author":"N Nisan","year":"1997","unstructured":"Nisan, N., Wigderson, A.: Lower bounds on arithmetic circuits via partial derivatives. Comput. Complexity 6(3), 217\u2013234 (1997)","journal-title":"Comput. Complexity"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00001609","volume":"10","author":"A Shpilka","year":"2001","unstructured":"Shpilka, A., Wigderson, A.: Depth-3 arithmetic formulae over fiel ds of characteristic zero. J. Comput. Complexity 10(1), 1\u201327 (2001)","journal-title":"J. Comput. Complexity"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Valiant, L.: Completeness classes in algebra. In: Technical report CSR-40-79, Department of Computer Science, University of Edinburgh, April 1979","DOI":"10.1145\/800135.804419"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T13:40:46Z","timestamp":1676468446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}