{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:46Z","timestamp":1725566746052},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_34","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"493-508","source":"Crossref","is-referenced-by-count":2,"title":["Feasible Proofs of Matrix Properties with Csanky\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Michael","family":"Soltys","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","first-page":"30","volume":"II","author":"M. Bonet","year":"1994","unstructured":"Bonet, M., Buss, S., Pitassi, T.: Are there hard examples for Frege systems? Feasible Mathematics\u00a0II, 30\u201356 (1994)","journal-title":"Feasible Mathematics"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","volume":"63","author":"S. Cook","year":"1993","unstructured":"Cook, S., Urquhart, A.: Functional interpretations of feasible constructive arithmetic. Annals of Pure and Applied Logic\u00a063, 103\u2013200 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"13","key":"34_CR3","first-page":"2","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Information and Computation\u00a064(13), 2\u201322 (1985)","journal-title":"Information and Computation"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(92)90149-A","volume":"101","author":"E. Gr\u00e4del","year":"1992","unstructured":"Gr\u00e4del, E.: Capturing complexity classes by fragments of second-order logic. Theoretical Computer Science\u00a0101(1), 35\u201357 (1992)","journal-title":"Theoretical Computer Science"},{"key":"34_CR5","first-page":"598","volume":"41","author":"A.A. Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mathematicheskie Zametki\u00a041, 598\u2013607 (1987); English translation in Mathematical Notes of the Academy of Sciences of the USSR\u00a041, 333\u2013338 (1987)","journal-title":"Mathematicheskie Zametki"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings, 19th ACM Symposium on Theory of Computing, pp. 77\u201382 (1987)","DOI":"10.1145\/28395.28404"},{"key":"34_CR7","unstructured":"Soltys, M.: The Complexity of Derivations of Matrix Identities. PhD thesis, University of Toronto (2001)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.apal.2003.10.018","volume":"130","author":"M. Soltys","year":"2004","unstructured":"Soltys, M., Cook, S.: The complexity of derivations of matrix identities. Annals of Pure and Applied Logic\u00a0130, 277\u2013323 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"34_CR9","volume-title":"Elementary Linear Algebra: A Matrix Approach","author":"L.E. Spence","year":"1999","unstructured":"Spence, L.E., Insel, A.J., Friedberg, S.H.: Elementary Linear Algebra: A Matrix Approach. Prentice-Hall, Englewood Cliffs (1999)"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00153-004-0249-8","volume":"44","author":"N. Thapen","year":"2005","unstructured":"Thapen, N., Soltys, M.: Weak theories of linear algebra. Archive for Mathematical Logic\u00a044(2), 195\u2013208 (2005)","journal-title":"Archive for Mathematical Logic"},{"key":"34_CR11","first-page":"574","volume-title":"Synthesis of Parallel Algorithms","author":"J. zur Gathen von","year":"1993","unstructured":"von zur Gathen, J.: Parallel linear algebra. In: Reif, J.H. (ed.) Synthesis of Parallel Algorithms, pp. 574\u2013617. Morgan and Kaufman, San Francisco (1993)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:17Z","timestamp":1619506457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11538363_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}