{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:20:18Z","timestamp":1725596418407},"publisher-location":"Vienna","reference-count":12,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211835937"},{"type":"electronic","value":"9783709162804"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/978-3-7091-6280-4_7","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T18:55:26Z","timestamp":1311015326000},"page":"69-78","source":"Crossref","is-referenced-by-count":1,"title":["Matrix Methods for Solving Algebraic Systems"],"prefix":"10.1007","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/337244.337247","volume":"47","author":"J Canny","year":"2000","unstructured":"Canny, J., Emiris, I.Z. (2000): A subdivision-based algorithm for the sparse resultant. J. ACM. 47:417\u2013451","journal-title":"J. ACM"},{"key":"7_CR2","series-title":"Technical Report","volume-title":"An algorithm for the Newton resultant","author":"J Canny","year":"1993","unstructured":"Canny, J., Pedersen, P. (1993): An algorithm for the Newton resultant. Technical Report 1394, Computer Science Department, Cornell University, Ithaca, New York"},{"key":"7_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using algebraic geometry","author":"D Cox","year":"1998","unstructured":"Cox, D., Little, J., O\u2019Shea, D. (1998): Using algebraic geometry. Springer, New York (Graduate Texts in Mathematics, vol. 185)"},{"key":"7_CR4","unstructured":"D\u2019Andrea, C., Emiris, I.Z. (2000): Solving sparse degenerate algebraic systems. Submitted for publication. ftp:\/\/ftp-sop.inria.fr\/saga\/emiris\/publis\/DAEmOO.ps.gz"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jsco.1995.1041","volume":"20","author":"IZ Emiris","year":"1995","unstructured":"Emiris, I.Z., Canny, J.F. (1995): Efficient incremental algorithms for the sparse resultant and the mixed volume. J. Symb. Comput. 20:117\u2013149","journal-title":"J. Symb. Comput"},{"key":"7_CR6","first-page":"372","volume":"25","author":"IZ Emiris","year":"1999","unstructured":"Emiris, I.Z., Mourrain, B. (1999): Computer algebra methods for studying and computing molecular conformations. Algorithmica, Special issue on algorithms for computational biology. 25:372\u2013402","journal-title":"Algorithmica, Special issue on algorithms for computational biology"},{"key":"7_CR7","first-page":"189","volume-title":"The structure of sparse resultant matrices","author":"IZ Emiris","year":"1997","unstructured":"Emiris, I.Z., Pan, V.Y. (1997): The structure of sparse resultant matrices. In: Proceedings of the ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, ISSAC\u2019 97, Maui, Hawaii. Association of Computing Machinery, New York, pp. 189\u2013196"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jsco.1998.0272","volume":"28","author":"T Gao","year":"1999","unstructured":"Gao, T., Li, T.Y., Wang, X. (1999): Finding isolated zeros of polynomial systems in C\n              n with stable mixed volumes. J. Symb. Comput. 28:187\u2013211","journal-title":"J. Symb. Comput"},{"key":"7_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants and resultants","author":"IM Gelfand","year":"1994","unstructured":"Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V. (1994): Discriminants and resultants. Birkh\u00fcuser, Boston"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Recent advances in molecular distance geometry","author":"TF Havel","year":"1997","unstructured":"Havel, T.F., Hyberts, S., Najfeld, I. (1997): Recent advances in molecular distance geometry. In: Bioinformatics, Springer, Berlin (Lecture Notes in Computer Science, vol. 1278)"},{"key":"7_CR11","unstructured":"Nikitopoulos, T.G. (1999): Matrix perturbation theory in distance geometry. Bachelor\u2019s thesis. INRIA Sophia-Antipolis. www.inria.fr\/saga\/stages\/arch.html"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1022497624378","volume":"3","author":"B Sturmfels","year":"1994","unstructured":"Sturmfels, B. (1994): On the Newton polytope of the resultant. J. Algebr. Combinat. 3:207\u2013236","journal-title":"J. Algebr. Combinat"}],"container-title":["Symbolic Algebraic Methods and Verification Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6280-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T09:32:43Z","timestamp":1606123963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6280-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783211835937","9783709162804"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6280-4_7","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}