{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T06:10:07Z","timestamp":1709359807821},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,30]],"date-time":"2008-10-30T00:00:00Z","timestamp":1225324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00453-008-9240-9","type":"journal-article","created":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T17:07:27Z","timestamp":1225300047000},"page":"35-50","source":"Crossref","is-referenced-by-count":2,"title":["Faster Combinatorial Algorithms for Determinant and\u00a0Pfaffian"],"prefix":"10.1007","volume":"56","author":[{"given":"Anna","family":"Urba\u0144ska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,30]]},"reference":[{"key":"9240_CR1","series-title":"North-Holland Mathematics Studies","volume-title":"Matching Theory, Ann. Discr. Math, vol. 29","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory, Ann. Discr. Math, vol. 29. North-Holland Mathematics Studies, vol. 121. North-Holland, Amsterdam (1986)"},{"key":"9240_CR2","first-page":"67","volume":"B42","author":"C. Krattenthaler","year":"1999","unstructured":"Krattenthaler, C.: Advanced determinant calculus. S\u00e9min. Lothar. Comb. B42, 67 (1999)","journal-title":"S\u00e9min. Lothar. Comb."},{"key":"9240_CR3","first-page":"182","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Strassen, V.: Vermeidung von Divisionen. J. Reine U. Angew. Math. 264, 182\u2013202 (1973)","journal-title":"J. Reine U. Angew. Math."},{"key":"9240_CR4","unstructured":"Mahajan, M., Vinay, V.: A combinatorial algorithm for the determinant. In: Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms, SODA97"},{"key":"9240_CR5","unstructured":"Mahajan, M., Vinay, V.: Determinant: combinatorics, algorithms and complexity. Chic. J. Theor. Comput. Sci. 5 (1997)"},{"key":"9240_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W. Baur","year":"1983","unstructured":"Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comput. Sci. 22, 317\u2013330 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"9240_CR7","series-title":"Lecture Notes Compute Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-45506-X_9","volume-title":"Computational Discrete Mathematics: Advanced Lectures","author":"G. Rote","year":"2001","unstructured":"Rote, G.: Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches. In: Alt, H. (ed.) Computational Discrete Mathematics: Advanced Lectures. Lecture Notes Compute Science, vol. 2122, pp. 119\u2013135. Springer, Berlin (2001)"},{"key":"9240_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198501626.001.0001","volume-title":"Fast Parallel Algorithms for Graph Matching Problems","author":"M. Karpi\u0144ski","year":"1998","unstructured":"Karpi\u0144ski, M., Rytter, W.: Fast Parallel Algorithms for Graph Matching Problems. Oxford University Press, Oxford (1998)"},{"key":"9240_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4968-9","volume-title":"Constructive Combinatorics","author":"D. Stanton","year":"1986","unstructured":"Stanton, D., White, D.: Constructive Combinatorics. Springer, New York (1986)"},{"key":"9240_CR10","first-page":"211","volume":"66","author":"D.E. Rutherford","year":"1964","unstructured":"Rutherford, D.E.: The Cayley-Hamilton theorem for semi-rings. Proc. R. Soc. Edinb. Sect. A 66, 211\u2013215 (1964)","journal-title":"Proc. R. Soc. Edinb. Sect. A"},{"key":"9240_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(83)90164-4","volume":"43","author":"H. Straubing","year":"1983","unstructured":"Straubing, H.: A combinatorial proof of the Cayley-Hamilton theorem. Discrete Math. 43, 273\u2013279 (1983)","journal-title":"Discrete Math."},{"key":"9240_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(85)90192-X","volume":"56","author":"D. Zeilberger","year":"1985","unstructured":"Zeilberger, D.: A combinatorial approach to matrix algebra. Discrete Math. 56, 61\u201372 (1985)","journal-title":"Discrete Math."},{"key":"9240_CR13","series-title":"LMS Lecture Notes Series","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1017\/CBO9780511526633.008","volume-title":"Boolean Function Complexity","author":"L.G. Valiant","year":"1992","unstructured":"Valiant, L.G.: Why is Boolean complexity theory difficult?. In: Paterson, M.S. (ed.) Boolean Function Complexity. LMS Lecture Notes Series, vol. 169, pp. 84\u201394. Cambridge Univ. Press, Cambridge (1992)"},{"key":"9240_CR14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/S0895480198338827","volume":"12","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Vinay, V.: Determinant: old algorithms, new insights. SIAM J. Discrete Math. 12, 474\u2013490 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9240_CR15","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, pp. 1\u20136 (1987)","DOI":"10.1145\/28395.28396"},{"issue":"1","key":"9240_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1006\/jcom.1997.0438","volume":"13","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Rectangular matrix multiplication revisited. J. Complex. 13(1), 42\u201349 (1997)","journal-title":"J. Complex."},{"key":"9240_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"9240_CR18","first-page":"13","volume":"2","author":"D. Knuth","year":"1996","unstructured":"Knuth, D.: Overlapping Pfaffians. Electron. J. Comb. 3 2, 13 (1996), article R5. Printed version. J.\u00a0Comb.\u00a03 2, 147\u2013159 (1996)","journal-title":"Electron. J. Comb. 3"},{"key":"9240_CR19","series-title":"Lecture Notes Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-48686-0_13","volume-title":"Computing and Combinatorics","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Subramanya, P., Vinay, V.: A combinatorial algorithm for Pfaffians. In: Asano, T., et al. (eds.) Computing and Combinatorics, Proc. Fifth Annual International Conference (COCOON \u201999), Tokyo, July 1999. Lecture Notes Computer Science, vol. 1627, pp. 134\u2013143. Springer, Berlin (1999)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9240-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9240-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9240-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T05:45:16Z","timestamp":1709358316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9240-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,30]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9240"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9240-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,30]]}}}