{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T23:10:02Z","timestamp":1746400202041,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662437988"},{"type":"electronic","value":"9783662437995"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43799-5_1","type":"book-chapter","created":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T03:46:18Z","timestamp":1412048778000},"page":"3-7","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symbolic Computation and Complexity Theory Transcript of My Talk"],"prefix":"10.1007","author":[{"given":"Erich L.","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"1_CR1","unstructured":"Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic. In: R. M. Karp, editor, Complexity of Computation, pp. 27\u201341. Amer. Math. Soc. (1974)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"EW Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problem for commutative semigroups and polynomial ideals. Advances Math. 46, 305\u2013329 (1982)","journal-title":"Advances Math."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hlich, A., Shepherdson, J.C.: Effective procedures in field theory. Phil. Trans. Roy. Soc. Ser. A 248, 407\u2013432 (1955\/1956)","DOI":"10.1098\/rsta.1956.0003"},{"key":"1_CR4","unstructured":"Cook, S.A.: Computational complexity of higher type functions. In: Proceedings of the ICM Kyoto Japan, ICM Series, pp. 55\u201369 (1990)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Trager, B.: Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput., 9(3):301\u2013320 (1990) URL: http:\/\/www.math.ncsu.edu\/kaltofen\/bibliography\/90\/KaTr90.pdf","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Koiran, P.: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. In: Jean-Guillaume Dumas, editor, ISSAC MMVI Proceedings of the 2006 International Symposium Symbolic Algebraic Computation, pp. 162\u2013168, New York, N. Y., 2006. ACM Press. ISBN 1-59593-276-3. URL: http:\/\/www.math.ncsu.edu\/kaltofen\/bibliography\/06\/KaKoi06.pdf","DOI":"10.1145\/1145768.1145798"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Guo, F., Kaltofen, E.L., Zhi, L.: Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. In: Joris van der Hoeven and Mark van Hoeij, editors, ISSAC 2012 Proceedings of the 37th International Symposium Symbolic Algebraic Computation, pp. 195\u2013202, New York, N. Y., July 2012. Association for Computing Machinery. ISBN 978-1-4503-1269. URL: http:\/\/www.math.ncsu.edu\/kaltofen\/bibliography\/12\/GKZ12.pdf;URL: http:\/\/arxiv.org\/abs\/1203.0253","DOI":"10.1145\/2442829.2442859"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Proceedings of the Eurocrypt 2010, volume 6110 of Lecture Notes in Computer Science, pp. 279\u2013298, Heidelberg, Germany, 2010. Springer Verlag","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Guo, Q., Safey El Din, M., Zhi, L.: Computing rational solutions of linear matrix inequalities. In: Manuel Kauers, editor, ISSAC 2013 Proceedings of the 38th International Symposium Symbolic Algebraic Computation, New York, N. Y., 2013. Association for Computing Machinery","DOI":"10.1145\/2465506.2465949"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Villard, G.: Computing the Frobenius normal form of a sparse matrix. In: Proceedings of the Third International Workshop on Computer Algebra in Scientific Computing, pp. 395\u2013407, Heidelberg, Germany, 2000. Springer Verlag","DOI":"10.1007\/978-3-642-57201-2_30"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comput., 67(223):1179\u20131197, July 1998. URL: http:\/\/www.math.ncsu.edu\/kaltofen\/bibliography\/98\/KaSh98.pdf","DOI":"10.1090\/S0025-5718-98-00944-2"}],"container-title":["Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43799-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T22:40:05Z","timestamp":1746398405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43799-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662437988","9783662437995"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43799-5_1","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}