{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:45:34Z","timestamp":1649094334259},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s11786-011-0068-3","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T09:49:02Z","timestamp":1316512142000},"page":"195-207","source":"Crossref","is-referenced-by-count":3,"title":["Solving the 100 Swiss Francs Problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Mingfu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangran","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"68_CR1","volume-title":"Gr\u00f6bner-Basis: An Algorithmic Method in Polynomial Ideal Theory","author":"B. Buchberger","year":"1985","unstructured":"Buchberger B.: Gr\u00f6bner-Basis: An Algorithmic Method in Polynomial Ideal Theory. Reidel Publishing Company, Dodrecht (1985)"},{"key":"68_CR2","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1353\/ajm.2006.0019","volume":"128","author":"F. Catanese","year":"2006","unstructured":"Catanese F., Ho\u015ften S., Khetan A., Sturmfels B.: The maximum likelihood degree. Am. J. Math. 128, 671\u2013697 (2006)","journal-title":"Am. J. Math."},{"issue":"1\u20133","key":"68_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re J.C.: A new efficient algorithm for computing Gr\u00f6bner basis (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner basis without reduction to zero (F5). In: ISSAC \u201902: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation. New York, NY, USA, ACM, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"68_CR5","volume-title":"Algebraic and geometric methods in statistics","author":"S. Fienberg","year":"2009","unstructured":"Fienberg S., Hersh P., Rinaldo A., Zhou Y. et\u00a0al.: Maximum likelihood estimation in latent class models for contingency table data. In: Gibilisco, P. (eds) Algebraic and geometric methods in statistics, Cambridge University Press, Cambridge (2009)"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Gao, S., Guan, Y., Volny, F. IV.: A new incremental algorithm for computing Gr\u00f6bner bases. In: ISSAC\u201910: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. Munich, Germany, ACM, pp. 13\u201319 (2010)","DOI":"10.1145\/1837934.1837944"},{"key":"68_CR7","unstructured":"Gao, S., Volny, F. IV., Wang, S.: A new algorithm for computing Gr\u00f6bner bases (2010). http:\/\/www.math.clemson.edu\/~sgao\/pub.html"},{"key":"68_CR8","volume-title":"Latent Structure Analysis","author":"N.W. Henry","year":"1968","unstructured":"Henry N.W., Lazarsfeld P.F.: Latent Structure Analysis. Houghton Mufflin Company, Houghton (1968)"},{"key":"68_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10208-004-0156-8","volume":"5","author":"S. Ho\u015ften","year":"2005","unstructured":"Ho\u015ften S., Khetan A., Sturmfels B.: Solving the likelihood equations. Found. Comput. Math. 5, 389\u2013407 (2005)","journal-title":"Found. Comput. Math."},{"key":"68_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511610684","volume-title":"Algebraic Statistics for Computational Biology","author":"L. Pachter","year":"2005","unstructured":"Pachter L., Sturmfels B.: Algebraic Statistics for Computational Biology. Cambridge University Press, Cambridge (2005)"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Open problems in Algebraic Statistics, In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 351\u2013364. I.M.A. Volumes in Mathematics and its Applications, vol. 149. Springer, New York (2008)","DOI":"10.1007\/978-0-387-09686-5_10"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0068-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-011-0068-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0068-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T01:33:48Z","timestamp":1560648828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-011-0068-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s11786-011-0068-3","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}