乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:12:45Z","timestamp":1725790365140},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,28]]},"DOI":"10.1145\/1576702.1576723","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T08:45:28Z","timestamp":1248770728000},"page":"135-142","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["On finding multiplicities of characteristic polynomial factors of black-box matrices"],"prefix":"10.1145","author":[{"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[{"name":"Grenoble Universit\u00e9, Grenoble, France"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Grenoble Universit\u00e9, Montbonnot, France"}]},{"given":"B. David","family":"Saunders","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.04.002"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199707)10:4%3C407::AID-RSA1%3E3.0.CO;2-Y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840433"},{"key":"e_1_3_2_1_4_1","first-page":"131","volume-title":"Transgressive Computing 2006","author":"Cung V.-D.","year":"2006","unstructured":"V.-D. Cung , V. Danjean , J.-G. Dumas , T. Gautier , G. Huard , B. Raffin , C. Rapine , J.-L. Roch , and D. Trystram . Adaptive and hybrid algorithms: classification and illustration on triangular system solving . In Transgressive Computing 2006 , pages 131 -- 148 , Apr. 2006 . V.-D. Cung, V. Danjean, J.-G. Dumas, T. Gautier, G. Huard, B. Raffin, C. Rapine, J.-L. Roch, and D. Trystram. Adaptive and hybrid algorithms: classification and illustration on triangular system solving. In Transgressive Computing 2006, pages 131--148, Apr. 2006."},{"key":"e_1_3_2_1_5_1","first-page":"139","volume-title":"CASC'2004","author":"Dumas J.-G.","year":"2004","unstructured":"J.-G. Dumas . Efficient dot product over finite fields . In CASC'2004 , pages 139 -- 154 , July 2004 . J.-G. Dumas. Efficient dot product over finite fields. In CASC'2004, pages 139--154, July 2004."},{"volume-title":"Apr.","year":"2007","author":"Dumas J.-G.","key":"e_1_3_2_1_6_1","unstructured":"J.-G. Dumas . Bounds on the coefficients of the characteristic and minimal polynomials. Journal of Inequalities in Pure and Applied Mathematics, 8(2):art. 31, 6 pp , Apr. 2007 . J.-G. Dumas. Bounds on the coefficients of the characteristic and minimal polynomials. Journal of Inequalities in Pure and Applied Mathematics, 8(2):art. 31, 6 pp, Apr. 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073905"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0451"},{"key":"e_1_3_2_1_9_1","first-page":"185","volume-title":"Transgressive Computing 2006","author":"Dumas J.-G.","year":"2006","unstructured":"J.-G. Dumas and A. Urba ńska. An introspective algorithm for the determinant . In Transgressive Computing 2006 , pages 185 -- 202 , Apr. 2006 . J.-G. Dumas and A. Urbańska. An introspective algorithm for the determinant. In Transgressive Computing 2006, pages 185--202, Apr. 2006."},{"key":"e_1_3_2_1_10_1","first-page":"47","volume-title":"CASC'2002","author":"Dumas J.-G.","year":"2002","unstructured":"J.-G. Dumas and G. Villard . Computing the rank of sparse matrices over finite fields . In CASC'2002 , pages 47 -- 62 , Sept. 2002 . J.-G. Dumas and G. Villard. Computing the rank of sparse matrices over finite fields. In CASC'2002, pages 47--62, Sept. 2002."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/345542.345596"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145785"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277569"},{"volume-title":"Chelsea","year":"1959","author":"Gantmacher F. R.","key":"e_1_3_2_1_14_1","unstructured":"F. R. Gantmacher . The Theory of Matrices . Chelsea , New York , 1959 . F. R. Gantmacher. The Theory of Matrices. Chelsea, New York, 1959."},{"volume-title":"Modern Computer Algebra","year":"1999","author":"v. Gathen J.","key":"e_1_3_2_1_15_1","unstructured":"J. v. Gathen and J. Gerhard . Modern Computer Algebra . Cambridge University Press , 1999 . J. v. Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004222"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0370"},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-54522-0_93","volume-title":"AAAAECC'91","author":"Kaltofen E.","year":"1991","unstructured":"E. Kaltofen and B. D. Saunders . On Wiedemann's method of solving sparse linear systems . In AAAAECC'91 , volume 539 of Lecture Notes in Computer Science , pages 29 -- 38 , Oct. 1991 . E. Kaltofen and B. D. Saunders. On Wiedemann's method of solving sparse linear systems. In AAAAECC'91, volume 539 of Lecture Notes in Computer Science, pages 29--38, Oct. 1991."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0185-3"},{"volume-title":"Fast algorithms for the characteristic polynomial. Theoretical computer science, 36:309--317","year":"1985","author":"Keller-Gehrig W.","key":"e_1_3_2_1_21_1","unstructured":"W. Keller-Gehrig . Fast algorithms for the characteristic polynomial. Theoretical computer science, 36:309--317 , 1985 . W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theoretical computer science, 36:309--317, 1985."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277590"},{"volume-title":"Apr.","year":"2000","author":"Storjohann A.","key":"e_1_3_2_1_24_1","unstructured":"A. Storjohann . Computing the frobenius form of a sparse integer matrix. to be submitted , Apr. 2000 . A. Storjohann. Computing the frobenius form of a sparse integer matrix. to be submitted, Apr. 2000."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57201-2_30"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"}],"event":{"name":"ISSAC '09: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Seoul Republic of Korea","acronym":"ISSAC '09"},"container-title":["Proceedings of the 2009 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1576702.1576723","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T14:38:59Z","timestamp":1673447939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1576702.1576723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"references-count":25,"alternative-id":["10.1145\/1576702.1576723","10.1145\/1576702"],"URL":"https:\/\/doi.org\/10.1145\/1576702.1576723","relation":{},"subject":[],"published":{"date-parts":[[2009,7,28]]},"assertion":[{"value":"2009-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}