{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:01Z","timestamp":1725490261054},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_36","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"408-420","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of the Minimal Polynomial"],"prefix":"10.1007","author":[{"given":"Thanh Minh","family":"Hoang","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Thierauf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E. Allender","year":"1999","unstructured":"E. Allender, R. Beals, and M. Ogihara. The complexity of matrix rank and feasible systems of linear equations. Computational Complexity, 8:99\u2013126, 1999.","journal-title":"Computational Complexity"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/03081087708817192","volume":"5","author":"C. Byrnes","year":"1977","unstructured":"C. Byrnes and M. Gauger. Characteristic free, improved decidability criteria for the similarity problem. Linear and Multilinear Algebra, 5:153\u2013158, 1977.","journal-title":"Linear and Multilinear Algebra"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"R. Brualdi and H. Ryser. Combinatorial Matrix Theory, volume 39 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9781107325708"},{"key":"36_CR4","unstructured":"D. Cvetkovi\u0107, M. Doob, and H. Sachs. Spectra of Graphs, Theory and Application. Academic Press, 1980."},{"key":"36_CR5","unstructured":"F. Gantmacher. The Theory of Matrices, volume 1 and 2. AMS Chelsea Publishing, 1977."},{"key":"36_CR6","unstructured":"A. Graham. Kronnecker Products and Matrix Calculus With Applications. Ellis Horwood Ltd., 1981."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"T. M. Hoang and T. Thierauf. The complexity of verifying the characteristic polynomial and testing similarity. In 15th IEEE Conference on Computational Complexity (CCC), pages 87\u201395. IEEE Computer Society Press, 2000.","DOI":"10.1109\/CCC.2000.856738"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/0608057","volume":"8","author":"E. Kaltofen","year":"1987","unstructured":"E. Kaltofen and B. Saunders. Fast parallel computation of hermite and smith forms of polynomial matrices. SIAM Algebraic and Discrete Methods, 8:683\u2013690, 1987.","journal-title":"SIAM Algebraic and Discrete Methods"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/PL00001596","volume":"7","author":"M. Santha","year":"1998","unstructured":"M. Santha and S. Tan. Verifying the determinant in parallel. Computational Complexity, 7:128\u2013151, 1998.","journal-title":"Computational Complexity"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"A. Storjohann. An O(n 3) algorithm for frobenius normal form. In International Symposium on Symbolic and Algebraic Computation (ISSAC), 1998.","DOI":"10.1145\/281508.281570"},{"key":"36_CR11","volume-title":"Technical Report CSIM 91-07","author":"S. Toda","year":"1991","unstructured":"S. Toda. Counting problems computationally equivalent to the determinant. Technical Report CSIM 91-07, Dept. of Computer Science and Information Mathematics, University of Electro-Communications, Chofu-shi, Tokyo 182, Japan, 1991."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"L. Valiant. Why is boolean complexity theory difficult. In M. S. Paterson, editor, Boolean Function Complexity, London Mathematical Society Lecture Notes Series 169. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526633.008"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s002000050089","volume":"8","author":"G. Villard","year":"1997","unstructured":"G. Villard. Fast parallel algorithms for matrix reduction to normal forms. Applicable Algebra in Engineering Communication and Computing (AAECC), 8:511\u2013537, 1997.","journal-title":"Applicable Algebra in Engineering Communication and Computing (AAECC)"},{"key":"36_CR14","unstructured":"J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:53Z","timestamp":1556818073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}