乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:18:22Z","timestamp":1725790702252},"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":[[2011,6,8]]},"DOI":"10.1145\/1993886.1993913","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T10:45:32Z","timestamp":1308048332000},"page":"155-162","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing hermite forms of polynomial matrices"],"prefix":"10.1145","author":[{"given":"Somit","family":"Gupta","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]},{"given":"Arne","family":"Storjohann","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1137\/S0895479892230031"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/309831.309929"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/j.jsc.2006.02.001"},{"key":"e_1_3_2_1_4_1","volume-title":"A Course in Computational Algebraic Number Theory","author":"Cohen H.","year":"1996","unstructured":"H. Cohen . A Course in Computational Algebraic Number Theory . Springer-Verlag , 1996 . H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, 1996."},{"key":"e_1_3_2_1_5_1","volume-title":"School of Operations Research and Industrial Engineering","author":"Domich P. D.","year":"1983","unstructured":"P. D. Domich . Three new polynomially-time bounded Hermite normal form algorithms. Master's thesis , School of Operations Research and Industrial Engineering , Cornell University , Ithaca, NY , 1983 . P. D. Domich. Three new polynomially-time bounded Hermite normal form algorithms. Master's thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1983."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1287\/moor.12.1.50"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/795666.796601"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/860854.860889"},{"key":"e_1_3_2_1_10_1","volume-title":"Triangular x-basis decompositions and derandomization of linear algebra algorithms over k{x}. 10","author":"Gupta S.","year":"2010","unstructured":"S. Gupta , S. Sarkar , A. Storjohann , and J. Valeriote . Triangular x-basis decompositions and derandomization of linear algebra algorithms over k{x}. 10 2010 . Submitted for publication. S. Gupta, S. Sarkar, A. Storjohann, and J. Valeriote. Triangular x-basis decompositions and derandomization of linear algebra algorithms over k{x}. 10 2010. Submitted for publication."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1137\/0220067"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1137\/0218045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1016\/j.jco.2004.03.005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/s00037-004-0185-3"},{"key":"e_1_3_2_1_15_1","volume-title":"Facult\u00e9 des Sciences Semlalia","author":"Labhalla S. E.","year":"1991","unstructured":"S. E. Labhalla . Complexit\u00e9 en temps polynomial : calcul d'une r\u00e9duite d'Hermite, les diff\u00e9rentes repr\u00e9sentations des nombres r\u00e9els. Doctorat d'Etat, Universit\u00e9 Cadi Ayyad , Facult\u00e9 des Sciences Semlalia , Marrakech , 1991 . S. E. Labhalla. Complexit\u00e9 en temps polynomial : calcul d'une r\u00e9duite d'Hermite, les diff\u00e9rentes repr\u00e9sentations des nombres r\u00e9els. Doctorat d'Etat, Universit\u00e9 Cadi Ayyad, Facult\u00e9 des Sciences Semlalia, Marrakech, 1991."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/384101.384133"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/S0747-7171(02)00139-6"},{"key":"e_1_3_2_1_18_1","volume-title":"Dept. of Computer Science","author":"Storjohann A.","year":"1994","unstructured":"A. Storjohann . Computation of Hermite and Smith normal forms of matrices. Master's thesis , Dept. of Computer Science , University of Waterloo , 1994 . A. Storjohann. Computation of Hermite and Smith normal forms of matrices. Master's thesis, Dept. of Computer Science, University of Waterloo, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/780506.780538"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/S0747-7171(03)00097-X"},{"key":"e_1_3_2_1_22_1","volume-title":"Challenges in Symbolic Computation Software, number 06271 in Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI)","author":"Storjohann A.","year":"2006","unstructured":"A. Storjohann . Notes on computing minimal approximant bases . In W. Decker, M. Dewar, E. Kaltofen, and S. Watt, editors, Challenges in Symbolic Computation Software, number 06271 in Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI) , Schloss Dagstuhl , Germany , 2006 . http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/776 {date of citation: 2006-01-01}. A. Storjohann. Notes on computing minimal approximant bases. In W. Decker, M. Dewar, E. Kaltofen, and S. Watt, editors, Challenges in Symbolic Computation Software, number 06271 in Dagstuhl Seminar Proceedings. Internationales Begegnungs-und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2006\/776 {date of citation: 2006-01-01}."},{"key":"e_1_3_2_1_23_1","volume-title":"Computational Complexity","author":"Storjohann A.","year":"2010","unstructured":"A. Storjohann . On the complexity of inverting integer and polynomial matrices . Computational Complexity , 2010 . Accepted for publication. A. Storjohann. On the complexity of inverting integer and polynomial matrices. Computational Complexity, 2010. Accepted for publication."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/236869.237083"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/236869.237082"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/860854.860905"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1576702.1576753"}],"event":{"sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"acronym":"ISSAC '11","name":"ISSAC '11: International Symposium on Symbolic and Algebraic Computation","location":"San Jose California USA"},"container-title":["Proceedings of the 36th international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993886.1993913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:47:08Z","timestamp":1672966028000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":25,"alternative-id":["10.1145\/1993886.1993913","10.1145\/1993886"],"URL":"https:\/\/doi.org\/10.1145\/1993886.1993913","relation":{},"subject":[],"published":{"date-parts":[[2011,6,8]]},"assertion":[{"value":"2011-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}