{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:50:32Z","timestamp":1744869032693},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221296"},{"type":"electronic","value":"9783540259442"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25944-2_37","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T11:55:44Z","timestamp":1285415744000},"page":"286-294","source":"Crossref","is-referenced-by-count":9,"title":["Development of SyNRAC\u2014Formula Description and New Functions"],"prefix":"10.1007","author":[{"given":"Hitoshi","family":"Yanami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirokazu","family":"Anai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/3-540-44860-8_86","volume-title":"Computational Science \u2013 ICCS 2003","author":"H. Anai","year":"2003","unstructured":"Anai, H., Yanami, H.: SyNRAC: A Maple-package for solving real algebraic constraints. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02657, pp. 828\u2013837. Springer, Heidelberg (2003)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. In: Matzat, B.H., Greuel, G.M., Hiss, G. (eds.) Algorithmic Algebra and Number Theory, pp. 221\u2013247. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-59932-3_11"},{"key":"37_CR3","unstructured":"Sakabe, K., Yanami, H., Anai, H., Hara, S.: A MATLAB toolbox for parametric robust control system design based on symbolic computation. In: Bulletin (Kokyuroku) of RIMS (Research Institute for Mathematical Sciences, Kyoto Univ.) Workshop on Computer Algebra\u2014Algorithms, Implementations and Applications 2003, December 15-18 (2003) (to appear)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Anai, H., Hara, S.: Fixed-structure robust controller synthesis based on sign definite condition by a special quantifier elimination. In: Proceedings of American Control Conference 2000, pp. 1312\u20131316 (2000)","DOI":"10.1109\/ACC.2000.876713"},{"key":"37_CR5","unstructured":"Anai, H., Hara, S.: Linear programming approach to robust controller design by a quantifier elimination. In: Proceedings of SICE Annual Conference 2002, Osaka, Japan, pp. 863\u2013869 (2002)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Anai, H., Hara, S.: A parameter space approach for fixed-order robust controller synthesis by symbolic computation. In: Proceedings of IFAC World Congress on Automatic Control b (2002)","DOI":"10.3182\/20020721-6-ES-1901.00394"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Anai, H., Yanami, H., Hara, S.: SyNRAC: a maple-package for solving real algebraic constraints toward a robust parametric control toolbox. In: Proceedings of SICE Annual Conference 2003, Fukui, Japan, pp. 1716\u20131721 (2003)","DOI":"10.1007\/3-540-44860-8_86"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002000050055","volume":"8","author":"V. Weispfenning","year":"1997","unstructured":"Weispfenning, V.: Quantifier elimination for real algebra\u2014the quadratic case and beyond. Applicable Algebra in Engineering Communication and Computing\u00a08, 85\u2013101 (1997)","journal-title":"Applicable Algebra in Engineering Communication and Computing"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1093\/comjnl\/36.5.450","volume":"36","author":"R. Loos","year":"1993","unstructured":"Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal\u00a036, 450\u2013462 (1993) Special issue on computational quantifier elimination","journal-title":"The Computer Journal"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1006\/jsco.1997.0123","volume":"24","author":"A. Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulae over ordered fields. Journal of Symbolic Computation\u00a024, 209\u2013231 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages. 2nd GI Conference","author":"G.E. Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) Automata Theory and Formal Languages. 2nd GI Conference, Gesellschaft f\u00fcr Informatik. LNCS, vol.\u00a033, pp. 134\u2013183. Springer, Heidelberg (1975)"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G.E. Collins","year":"1991","unstructured":"Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation\u00a012, 299\u2013328 (1991)","journal-title":"Journal of Symbolic Computation"},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-7091-9459-1_19","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and monographs in symbolic computation","author":"L. Gonz\u00e1lez-Vega","year":"1998","unstructured":"Gonz\u00e1lez-Vega, L.: A combinatorial algorithm solving some quantifier elimination problems. In: Caviness, B., Johnson, J. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and monographs in symbolic computation, pp. 365\u2013375. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25944-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:10:53Z","timestamp":1558293053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25944-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221296","9783540259442"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25944-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}