{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:03:07Z","timestamp":1759838587168},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Comput"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf02390521","type":"journal-article","created":{"date-parts":[[2006,4,10]],"date-time":"2006-04-10T10:32:07Z","timestamp":1144665127000},"page":"41-64","source":"Crossref","is-referenced-by-count":17,"title":["A combined method for enclosing all solutions of nonlinear systems of polynomial equations"],"prefix":"10.1007","volume":"1","author":[{"given":"Christine","family":"J\u00e4ger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietmar","family":"Ratz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u041a.","family":"\u0439\u0435\u0433\u0435\u0440","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u041b.","family":"\u0420\u0430\u0446","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02390521_CR1","volume-title":"Introduction to interval computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld, G. andHerzberger J..Introduction to interval computations, Academic Press, New York, 1983."},{"key":"BF02390521_CR2","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B. Buchberger","year":"1970","unstructured":"Buchberger, B..Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems. Aequationes Mathematicae4 (1970), pp. 374\u2013383.","journal-title":"Aequationes Mathematicae"},{"key":"BF02390521_CR3","first-page":"19","volume":"39","author":"B. Buchberger","year":"1976","unstructured":"Buchberger, B..Theoretical basis for the reduction of polynomials to canonical forms.SIGSAM Bulletin 39 (1976), pp. 19\u201329.","journal-title":"SIGSAM Bulletin"},{"key":"BF02390521_CR4","first-page":"19","volume":"40","author":"B. Buchberger","year":"1976","unstructured":"Buchberger, B..Some properties of Gr\u00f6bner bases for polynomial ideals. SIGSAM Bulletin40 (1976). pp. 19\u201324.","journal-title":"SIGSAM Bulletin"},{"key":"BF02390521_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-09519-5_52","volume-title":"Proceedings of the 1979 European Symposium on Symbolic and Algebraic Computation","author":"B. Buchberger","year":"1979","unstructured":"Buchberger, B..A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner bases. In: \u201cProceedings of the 1979 European Symposium on Symbolic and Algebraic Computation\u201d. Lecture Notes in Computer Science 72, Springer-Verlag, Berlin, Heidelberg, 1979. pp.3\u201321."},{"key":"BF02390521_CR6","unstructured":"Buchberger, B.H-bases and Gr\u00f6bner bases for polynomial ideals. CAMP-Linz publication 81-20, University of Linz. 1981."},{"key":"BF02390521_CR7","unstructured":"Buchberger, B.A. survey on the method of Gr\u00f6bner bases for solving problems in connection with systems of multivariate polynomials. In: Inada, N. and Soma, T. (eds) \u201cProceedings of the 2nd RIKEN Symposium on Symbolic and Algebraic Computation\u201d, World Scientific Publ., 1985, pp. 69\u201383."},{"key":"BF02390521_CR8","volume-title":"Computer algebra, systems and algorithms for algebraic computation","author":"J. H. Davenport","year":"1988","unstructured":"Davenport, J. H., Siret, Y., and Tournier, E.Computer algebra, systems and algorithms for algebraic computation. Academic Press, New York, 1988."},{"key":"BF02390521_CR9","unstructured":"Gaganov, A. A.Computational complexity of the range of the polynomial in several variables. Cybernetics (1985). pp. 418\u2013421."},{"key":"BF02390521_CR10","volume-title":"Numerical toolbox for verified computing I \u2014 Basic numerical problems","author":"R. Hammer","year":"1993","unstructured":"Hammer, R., Hocks, M., Kulisch U., and Ratz, D.Numerical toolbox for verified computing I \u2014 Basic numerical problems. Springer-Verlag, Heidelberg, 1993."},{"key":"BF02390521_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF01932020","volume":"18","author":"E. Hansen","year":"1978","unstructured":"Hansen, E..A globally convergent interval method for computing and bounding real roots. BIT18 (1978), pp. 415\u2013424.","journal-title":"BIT"},{"key":"BF02390521_CR12","volume-title":"Global optimization using interval analysis","author":"E. Hansen","year":"1992","unstructured":"Hansen, E.Global optimization using interval analysis. Marcel Dekker, New York, 1992."},{"key":"BF02390521_CR13","first-page":"59","volume":"1","author":"R. B. Kearfou","year":"1991","unstructured":"Kearfou R. B., Hu, C. and Novoa, M.A review of preconditioners for the interval Gauss-Seidel method. Interval Computations1 (1991), pp. 59\u201385.","journal-title":"Interval Computations"},{"key":"BF02390521_CR14","volume-title":"PASCAL-SSC \u2014 language reference with examples","author":"R. Klatte","year":"1992","unstructured":"Klatte, R., Kulisch, U., Neaga, M., Ratz, D., and Ullrich, Ch.PASCAL-SSC \u2014 language reference with examples. Springer-Verlag, Berlin etc., 1992."},{"key":"BF02390521_CR15","volume-title":"Computer arithimetic in theory and practice","author":"U. Kulisch","year":"1981","unstructured":"Kulisch U. and Miranker, W. L.Computer arithimetic in theory and practice. Academic Press, New York, 1981."},{"key":"BF02390521_CR16","volume-title":"Interial analysis","author":"R. E. Moore","year":"1966","unstructured":"Moore, R. E..Interial analysis. Prentice-Hall, Englewood Cliffs, 1966."},{"key":"BF02390521_CR17","volume-title":"Interval methods for systems of equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.Interval methods for systems of equations. Cambridge University Press, Cambridge, 1990."},{"key":"BF02390521_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5592-3","volume-title":"Introduction to numerical analysis","author":"J. Stoer","year":"1980","unstructured":"Stoer, J. and Bulirsch, R.Introduction to numerical analysis. Springer-Verlag, New York, 1980."},{"key":"BF02390521_CR19","volume-title":"Modern algebra","author":"B. L. Waerden van der","year":"1949","unstructured":"van der Waerden, B. L.Modern algebra, Fr\u00e9derick Ungar, New York, 1949."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02390521.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02390521\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02390521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:07:44Z","timestamp":1558094864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02390521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF02390521"],"URL":"https:\/\/doi.org\/10.1007\/bf02390521","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"value":"1385-3139","type":"print"},{"value":"1573-1340","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}