{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:01:27Z","timestamp":1725829287050},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240206"},{"type":"electronic","value":"9783319240213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24021-3_7","type":"book-chapter","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T07:58:36Z","timestamp":1441267116000},"page":"87-100","source":"Crossref","is-referenced-by-count":4,"title":["Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Bliss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Sommars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Verschelde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangcheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"7_CR1","unstructured":"Adrovic, D., Verschelde, J.: A polyhedral method to compute all affine solution sets of sparse polynomial systems. arXiv:1310.4128"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Adrovic, D., Verschelde, J.: Computing Puiseux series for algebraic surfaces. In: van der Hoeven, J., van Hoeij, M. (eds.) Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC 2012), pp. 20\u201327. ACM (2012)","DOI":"10.1145\/2442829.2442837"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Adrovic, D., Verschelde, J.: Polyhedral methods for space curves exploiting symmetry applied to the cyclic n-roots problem. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 10\u201329. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-319-02297-0_2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Boege, W., Gebauer, R., Kredel, H.: Some examples for solving systems of algebraic equations by calculating groebner bases. J. Symbolic Computation 2, 83\u201398 (1986)","DOI":"10.1016\/S0747-7171(86)80014-1"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Fouque, P.-A., V\u00e9ber, A.: Graph-theoretic algorithms for the \u201cisomorphism of polynomials\u201d problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 211\u2013227. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38348-9_13"},{"key":"7_CR6","unstructured":"Coar, K., Bower, R.: Apache Cookbook. 1st edn. O\u2019Reilly Media, Inc. (2004)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Comer, D.: Ubiquitous b-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979)","DOI":"10.1145\/356770.356776"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Datta, R.: Finding all nash equilibria of a finite game using polynomial algebra. Economic Theory 42(1), 55\u201396 (2009)","DOI":"10.1007\/s00199-009-0447-z"},{"key":"7_CR9","unstructured":"DuBois, P.: MySQL Cookbook. 2nd edn. O\u2019Reilly Media, Inc. (2006)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial equivalence problems: algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30\u201347. Springer, Heidelberg (2006)","DOI":"10.1007\/11761679_3"},{"key":"7_CR11","unstructured":"Frucht, R.: Herstellung von Graphen mit vorgegebener abstrakter Gruppe. Compositio Mathematica 6, 239\u2013250 (1939)"},{"key":"7_CR12","unstructured":"Gao, T., Li, T., Wu, M.: Algorithm 846: MixedVol: a software package for mixed-volume computation. ACM Trans. Math. Softw. 31(4), 555\u2013560 (2005)"},{"key":"7_CR13","unstructured":"Grayson, D., Stillman, M.: Macaulay2, a software system for research in algebraic geometry. http:\/\/www.math.uiuc.edu\/Macaulay2\/"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Gross, E., Petrovi\u0107, S., Verschelde, J.: PHCpack in Macaulay2. The Journal of Software for Algebra and Geometry: Macaulay 2(5), 20\u201325 (2013)","DOI":"10.2140\/jsag.2013.5.20"},{"key":"7_CR15","unstructured":"Huber, B., Sturmfels, B.: A polyhedral method for solving sparse polynomial systems. Math. Comp. 64(212), 1541\u20131555 (1995)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Huber, B., Verschelde, J.: Polyhedral end games for polynomial continuation. Numerical Algorithms 18(1), 91\u2013108 (1998)","DOI":"10.1023\/A:1019163811284"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Jensen, A., Markwig, H., Markwig, T.: An algorithm for lifting points in a tropical variety. Collectanea Mathematica 59(2), 129\u2013165 (2008)","DOI":"10.1007\/BF03191365"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Schwartz, A.: On the complexity of polytope isomorphism problems. Graphs and Combinatorics 19(2), 215\u2013230 (2003)","DOI":"10.1007\/s00373-002-0503-y"},{"key":"7_CR19","unstructured":"Katsura, S.: Spin glass problem by the method of integral equation of the effective field. In: Coutinho-Filho, M., Resende, S. (eds.) New Trends in Magnetism, pp. 110\u2013121. World Scientific (1990)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Li, T.: Numerical solution of polynomial systems by homotopy continuation methods. In: Cucker, F. (ed.) Handbook of Numerical Analysis, vol. 11. Special Volume: Foundations of Computational Mathematics, pp. 209\u2013304. North-Holland (2003)","DOI":"10.1016\/S1570-8659(02)11004-0"},{"key":"7_CR21","unstructured":"McKay, B., Piperno, A.: nautyTraces, software distribution web page. http:\/\/cs.anu.edu.au\/~bdm\/nauty\/ and http:\/\/pallini.di.uniroma1.it\/"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"McKay, B., Piperno, A.: Practical graph isomorphism II. Journal of Symbolic Computation 60, 94\u2013112 (2014)","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"McKelvey, R., McLennan, A.: The maximal number of regular totally mixed Nash equilibria. Journal of Economic Theory 72, 411\u2013425 (1997)","DOI":"10.1006\/jeth.1996.2214"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-68339-9_4"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, F., Granger, B., Hunter, J.: Python: An ecosystem for scientific computing. Computing in Science & Engineering 13(2), 12\u201321 (2011)","DOI":"10.1109\/MCSE.2010.119"},{"key":"7_CR26","unstructured":"Piret, K.: Computing Critical Points of Polynomial Systems using PHCpack and Python. PhD thesis, University of Illinois at Chicago (2008)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Rehr, J., Vila, F., Gardner, J., Svec, L., Prange, M.: Scientific computing in the cloud. Computing in Science & Engineering 12(3), 34\u201343 (2010)","DOI":"10.1109\/MCSE.2010.70"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Shirt-Ediss, B., Sole, R., Ruiz-Mirazo, K.: Emergent chemical behavior in variable-volume protocells. Life 5, 181\u2013121 (2015)","DOI":"10.3390\/life5010181"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Sommese, A., Verschelde, J., Wampler, C.: Numerical irreducible decomposition using PHCpack. In: Joswig, M., Takayama, N. (eds.) Algebra, Geometry, and Software Systems, pp. 109\u2013130. Springer (2003)","DOI":"10.1007\/978-3-662-05148-1_6"},{"key":"7_CR30","unstructured":"Stein, W., et\u00a0al.: Sage Mathematics Software (Version 6.5). The Sage Development Team. (2015). http:\/\/www.sagemath.org"},{"key":"7_CR31","unstructured":"Verschelde, J.: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25(2), 251\u2013276 (1999)"},{"key":"7_CR32","unstructured":"Verschelde, J.: Modernizing PHCpack through phcpy. In: de Buyl, P., Varoquaux, N. (eds.) Proceedings of the 6th European Conference on Python in Science (EuroSciPy 2013), pp. 71\u201376 (2014)"},{"key":"7_CR33","unstructured":"Verschelde, J., Verlinden, P., Cools, R.: Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31(3), 915\u2013930 (1994)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Verschelde, J., Yu, X.: Accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic. arXiv:1501.06625, accepted for publication in the Proceedings of the 7th International Workshop on Parallel Symbolic Computation (PASCO 2015)","DOI":"10.1145\/2790282.2790294"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Verschelde, J., Yu, X.: Tracking many solution paths of a polynomial homotopy on a graphics processing unit. arXiv:1505.00383, accepted for publication in the Proceedings of the 17th IEEE International Conference on High Performance Computing and Communications (HPCC 2015)","DOI":"10.1109\/HPCC-CSS-ICESS.2015.98"}],"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-24021-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:12:29Z","timestamp":1599520349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24021-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240206","9783319240213"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24021-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}