{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:50Z","timestamp":1760061530245,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:00:00Z","timestamp":1185667200000},"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":[[2007,7,29]]},"DOI":"10.1145\/1277548.1277590","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"307-314","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Faster algorithms for the characteristic polynomial"],"prefix":"10.1145","author":[{"given":"Cl\u00e9ment","family":"Pernet","sequence":"first","affiliation":[{"name":"University of Waterloo, Ontario, Canada"}]},{"given":"Arne","family":"Storjohann","sequence":"additional","affiliation":[{"name":"University of Waterloo, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2007,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780515"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005304"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073905"},{"key":"e_1_3_2_1_5_1","volume-title":"Department of Computer Science","author":"Eberly W.","year":"2000","unstructured":"W. Eberly . Asymptotically efficient algorithms for the Frobenius form. Technical report , Department of Computer Science , University of Calgary , 2000 . W. Eberly. Asymptotically efficient algorithms for the Frobenius form. Technical report, Department of Computer Science, University of Calgary, 2000."},{"key":"e_1_3_2_1_6_1","volume-title":"The Theory of Matrices","author":"Gantmacher F.R.","year":"1990","unstructured":"F.R. Gantmacher . The Theory of Matrices volume 1 . Chelsea Publishing Company , New York, NY , 1990 . F.R. Gantmacher. The Theory of Matrices volume1. Chelsea Publishing Company, New York, NY, 1990."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793252687"},{"key":"e_1_3_2_1_9_1","volume-title":"Englewood Clikffs","author":"Hoffman K.","year":"1971","unstructured":"K. Hoffman and R. Kunze . Linear Algebra Prentice-Hall , Englewood Clikffs , N.J. , 1971 . K. Hoffman and R. Kunze. Linear Algebra Prentice-Hall, Englewood Clikffs, N.J., 1971."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3929.3939"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_14_1","first-page":"368","volume-title":"Proc. 42nd Annual Symp. Foundations of Comp. Sci.","author":"Storjohann A.","year":"2001","unstructured":"A. Storjohann . Deterministic computation of the Frobenius form (Extended Abstract) . In Proc. 42nd Annual Symp. Foundations of Comp. Sci. pages 368 -- 377 , Los Alamitos, California , 2001 . IEEE Computer Society Press. A. Storjohann. Deterministic computation of the Frobenius form (Extended Abstract). In Proc. 42nd Annual Symp. Foundations of Comp. Sci. pages 368--377, Los Alamitos, California, 2001. IEEE Computer Society Press."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.698972"}],"event":{"name":"ISSAC07: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Waterloo Ontario Canada","acronym":"ISSAC07"},"container-title":["Proceedings of the 2007 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277590","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1277548.1277590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:13Z","timestamp":1750258693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1277548.1277590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,29]]},"references-count":13,"alternative-id":["10.1145\/1277548.1277590","10.1145\/1277548"],"URL":"https:\/\/doi.org\/10.1145\/1277548.1277590","relation":{},"subject":[],"published":{"date-parts":[[2007,7,29]]},"assertion":[{"value":"2007-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}