{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:05Z","timestamp":1750307885955,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,20]],"date-time":"2008-07-20T00:00:00Z","timestamp":1216512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,20]]},"DOI":"10.1145\/1390768.1390790","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"141-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Expressing a fraction of two determinants as a determinant"],"prefix":"10.1145","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[{"name":"NCSU, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[{"name":"ENSL and UCBL, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80012-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178683"},{"key":"e_1_3_2_1_4_1","series-title":"Lect","first-page":"63","volume-title":"Proc. FCT '85 (Heidelberg","author":"Chistov A. L.","year":"1985","unstructured":"Chistov , A. L. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic . In Proc. FCT '85 (Heidelberg , Germany, 1985 ), vol. 199 of Lect . Notes Comput. Sci., Springer Verlag , pp. 63 -- 69 . Chistov, A. L. Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. In Proc. FCT '85 (Heidelberg, Germany, 1985), vol. 199 of Lect. Notes Comput. Sci., Springer Verlag, pp. 63--69."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-03-00423-5"},{"key":"e_1_3_2_1_7_1","volume-title":"Modern Computer Algebra","author":"Gathenvon zur Gathen J.","year":"1999","unstructured":"\\ Gathenvon zur Gathen , J. , and Gerhard , J . Modern Computer Algebra . Cambridge University Press , Cambridge, New York, Melbourne, 1999 . Second edition 2003. \\Gathenvon zur Gathen, J., and Gerhard, J. Modern Computer Algebra. Cambridge University Press, Cambridge, New York, Melbourne, 1999. Second edition 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/42267.45069"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0185-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780525"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005316"},{"key":"e_1_3_2_1_12_1","series-title":"Lect","first-page":"101","volume-title":"Proc. AWOC 88 (Heidelberg","author":"Kosaraju S. R.","year":"1988","unstructured":"Kosaraju , S. R. , and Delcher , A. L . Optimal parallel evaluation of tree-structured computations by raking . In Proc. AWOC 88 (Heidelberg , Germany, 1988 ), vol. 319 of Lect . Notes Comput. Sci., Springer Verlag , pp. 101 -- 110 . Kosaraju, S. R., and Delcher, A. L. Optimal parallel evaluation of tree-structured computations by raking. In Proc. AWOC 88 (Heidelberg, Germany,1988), vol. 319 of Lect. Notes Comput. Sci., Springer Verlag, pp. 101--110."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.3792\/chmm\/1263317740","volume-title":"The Algebraic Theory of Modular Systems. No. 19 in Cambridge Tracts","author":"Macaulay F. S.","year":"1916","unstructured":"Macaulay , F. S. The Algebraic Theory of Modular Systems. No. 19 in Cambridge Tracts . The University Press , Cambridge, Great Britain, 1916 . Reissued in the Cambridge Mathematical Library with an Introduction by Paul Roberts, 1994. Macaulay, F. S. The Algebraic Theory of Modular Systems. No. 19 in Cambridge Tracts. The University Press, Cambridge, Great Britain, 1916. Reissued in the Cambridge Mathematical Library with an Introduction by Paul Roberts, 1994."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.09.006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217044"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_18_1","volume-title":"reine u. angew. Math. 264","author":"Strassen V.","year":"1973","unstructured":"Strassen , V. Vermeidung von Division en. J. reine u. angew. Math. 264 ( 1973 ), 182--202. In German . Strassen, V. Vermeidung von Divisionen. J. reine u. angew. Math. 264 (1973), 182--202. In German."},{"key":"e_1_3_2_1_19_1","volume-title":"Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems E75-D, 1 (Jan","author":"Toda S.","year":"1992","unstructured":"Toda , S. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems E75-D, 1 (Jan . 1992 ), 116--124. Toda, S. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems E75-D, 1 (Jan. 1992), 116--124."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_1_22_1","series-title":"Lect","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation (Heidelberg","author":"Zippel R.","year":"1979","unstructured":"Zippel , R. Probabilistic algorithms for sparse polynomials . In Symbolic and Algebraic Computation (Heidelberg , Germany, 1979 ), vol. 72 of Lect . Notes Comput. Sci., Springer Verlag , pp. 216 -- 226 . Proc. EUROSAM '79. Zippel, R. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation (Heidelberg, Germany, 1979), vol. 72 of Lect. Notes Comput. Sci., Springer Verlag, pp. 216--226. Proc. EUROSAM '79."}],"event":{"name":"ISSAC '08: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Linz\/Hagenberg Austria","acronym":"ISSAC '08"},"container-title":["Proceedings of the twenty-first international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1390768.1390790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1390768.1390790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:11Z","timestamp":1750258031000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1390768.1390790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,20]]},"references-count":22,"alternative-id":["10.1145\/1390768.1390790","10.1145\/1390768"],"URL":"https:\/\/doi.org\/10.1145\/1390768.1390790","relation":{},"subject":[],"published":{"date-parts":[[2008,7,20]]},"assertion":[{"value":"2008-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}