{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:46Z","timestamp":1725745306645},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319022963"},{"type":"electronic","value":"9783319022970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02297-0_11","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T07:37:38Z","timestamp":1376465858000},"page":"136-139","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees"],"prefix":"10.1007","author":[{"given":"Dima","family":"Grigoriev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1007\/BF01095643","volume":"34","author":"A. Chistov","year":"1986","unstructured":"Chistov, A.: An algorithm of polynomial complexity for factoring polynomials, and determination of the components of a variety in a subexponential time. J. Soviet Math.\u00a034, 1838\u20131882 (1986)","journal-title":"J. Soviet Math."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1007\/BF01095638","volume":"34","author":"D. Grigoriev","year":"1986","unstructured":"Grigoriev, D.: Polynomial factoring over a finite field and solving systems of algebraic equations. J. Soviet Math.\u00a034, 1762\u20131803 (1986)","journal-title":"J. Soviet Math."},{"key":"11_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0030287","volume-title":"Mathematical Foundations of Computer Science 1984","author":"A. Chistov","year":"1984","unstructured":"Chistov, A., Grigoriev, D.: Complexity of quantifier elimination in the theory of algebraically closed fields. In: Chytil, M.P., Koubek, V. (eds.) Mathematical Foundations of Computer Science 1984. LNCS, vol.\u00a0176, pp. 17\u201331. Springer, Heidelberg (1984)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. I. Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symbolic Comput.\u00a013, 255\u2013299 (1992)","journal-title":"J. Symbolic Comput."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-005-0189-7","volume":"14","author":"D. Grigoriev","year":"2005","unstructured":"Grigoriev, D., Pasechnik, D.: Polynomial-time computing over quadratic maps I. Sampling in real algebraic sets. Computational Complexity\u00a014, 20\u201352 (2005)","journal-title":"Computational Complexity"},{"key":"11_CR6","first-page":"166","volume-title":"Proc. 28 Symp. Found. Comput. Sci.","author":"D. Grigoriev","year":"1987","unstructured":"Grigoriev, D., Karpinski, M.: The matching problem for bipartite graphs with polynomially bounded permanents is in NC. In: Proc. 28 Symp. Found. Comput. Sci., pp. 166\u2013172. IEEE, New York (1987)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Shafarevich, I.: Foundations of algebraic geometry. MacMillan Journals (1969)","DOI":"10.1070\/RM1969v024n06ABEH001361"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Lang, S.: Algebra. Springer (2002)","DOI":"10.1007\/978-1-4613-0041-0"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1137\/0219073","volume":"19","author":"D. Grigoriev","year":"1990","unstructured":"Grigoriev, D., Karpinski, M., Singer, M.: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput.\u00a019, 1059\u20131063 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02297-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:28:30Z","timestamp":1558009710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02297-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319022963","9783319022970"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02297-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}