{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T01:34:10Z","timestamp":1712453650825},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1007\/bf02711134","type":"journal-article","created":{"date-parts":[[2007,10,11]],"date-time":"2007-10-11T09:43:25Z","timestamp":1192095805000},"page":"69-112","source":"Crossref","is-referenced-by-count":31,"title":["Mixed-volume computation by dynamic lifting applied to polynomial system solving"],"prefix":"10.1007","volume":"16","author":[{"given":"J.","family":"Verschelde","sequence":"first","affiliation":[]},{"given":"K.","family":"Gatermann","sequence":"additional","affiliation":[]},{"given":"R.","family":"Cools","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF02711134_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra.Discrete Comput Geom., 8(3):295\u2013313, 1992.","journal-title":"Discrete Comput Geom."},{"key":"BF02711134_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/120694.120708","volume-title":"Proceedings of ISSAC-91","author":"J. Backelin","year":"1991","unstructured":"J. Backelin and R. Fr\u00f6berg. How we proved that there are exactly 924 cyclic 7-roots.Proceedings of ISSAC-91, pages 103\u2013111, ACM, New York, 1991."},{"issue":"3","key":"BF02711134_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01075595","volume":"9","author":"D. N. Bernshte\u00een","year":"1975","unstructured":"D. N. Bernshte\u00een. The number of roots of a system of equations.Functional Anal. Appl., 9(3):183\u2013185, 1975. Translated fromFunksional. Anal. i Prilozhen., 9(3):1\u20134, 1975.","journal-title":"Functional Anal. Appl."},{"key":"BF02711134_CR4","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver.Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, volume 2. Springer-Verlag, Berlin, 1988."},{"issue":"4","key":"BF02711134_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","volume":"7","author":"L. J. Guibas","year":"1992","unstructured":"L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams.Algorithmica, 7(4):381\u2013413, 1992.","journal-title":"Algorithmica"},{"key":"BF02711134_CR6","unstructured":"B. Huber. Numerically solving sparce polynomial systems. Presented at AMS-IMS-SIAM Summer Research Conference on Continuous Algorithms and Complexity, Mount Holyoke College, South Hadley, MA, June 1994."},{"issue":"212","key":"BF02711134_CR7","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1090\/S0025-5718-1995-1297471-4","volume":"64","author":"B. Huber","year":"1995","unstructured":"B. Huber and B. Sturmfels. A polyhedral method for solving sparse polynomial systems.Math. Comp., 64(212):1541\u20131555, 1995.","journal-title":"Math. Comp."},{"issue":"1","key":"BF02711134_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1215\/S0012-7094-92-06707-X","volume":"67","author":"M. M. Kapranov","year":"1992","unstructured":"M. M. Kapranov, B. Sturmfels, and A. V. Zelevinsky. Chow polytopes and general resultants.Duke Math. J., 67(1):189\u2013218, 1992.","journal-title":"Duke Math. J."},{"issue":"1","key":"BF02711134_CR9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/BF01077562","volume":"12","author":"A. G. Khovanski\u00ee","year":"1978","unstructured":"A. G. Khovanski\u00ee. Newton polyhedra and the genus of complete intersections.Functional Anal. Appl. 12(1):38\u201346, 1978. Translated fromFunktsional. Anal. i Prilozhen., 12(1), 51\u201361, 1978.","journal-title":"Functional Anal. Appl."},{"issue":"3","key":"BF02711134_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01075534","volume":"10","author":"A. G. Kushnirenko","year":"1976","unstructured":"A. G. Kushnirenko. Newton polytopes and the B\u00e9zout theorem.Functional Anal. Appl., 10(3):233\u2013235, 1976. Translated fromFunktsional. Anal. i Prilozhen., 10(3), 82\u201383, 1976.","journal-title":"Functional Anal. Appl."},{"key":"BF02711134_CR11","volume-title":"Convex Sets and Their Applications","author":"S. R. Lay","year":"1982","unstructured":"S. R. Lay,Convex Sets and Their Applications, Wiley, New York, 1982."},{"key":"BF02711134_CR12","series-title":"DIMACS Series","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1090\/dimacs\/004\/35","volume-title":"Applied Geometry and Discrete Mathematics\u2014The Victor Klee Festschrift","author":"C. W. Lee","year":"1991","unstructured":"C. W. Lee. Regular triangulations of convex polytopes. In P. Gritzmann and B. Sturmfels, editors,Applied Geometry and Discrete Mathematics\u2014The Victor Klee Festschrift, pages 443\u2013456. DIMACS Series, volume 4, AMS, Providence, RI, 1991."},{"key":"BF02711134_CR13","volume-title":"Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems","author":"A. Morgan","year":"1987","unstructured":"A. Morgan.Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Prentice-Hall, Englewood Cliffs, NJ, 1987."},{"issue":"2","key":"BF02711134_CR14","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/328512.328521","volume":"13","author":"A. Morgan","year":"1987","unstructured":"A. Morgan and V. Shapiro. Box-bisection for solving second-degree systems and the problem of clustering.ACM Trans. Math. Software, 13(2):152\u2013167, 1987.","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"BF02711134_CR15","first-page":"123","volume":"29","author":"A. P. Morgan","year":"1989","unstructured":"A. P. Morgan and A. J. Sommese. Coefficient-parameter polynomial continuation.Appl. Math. Comput., 29(2):123\u2013160, 1989. Errata: 51:207, 1992.","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"BF02711134_CR16","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1137\/0732061","volume":"32","author":"A. P. Morgan","year":"1995","unstructured":"A. P. Morgan, A. J. Sommese and C. W. Wampler. A product-decomposition theorem for bounding B\u00e9zout numbers.SIAM J. Numer. Anal., 32(4):1308\u20131325, 1995.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02711134_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0377-0427(89)90025-3","volume":"27","author":"A. P. Morgan","year":"1989","unstructured":"A. P. Morgan, A. Sommese and L. T. Watson. Mathematical reduction of a heart dipole model.J. Comput. Appl. Math., 27:407\u2013410, 1989.","journal-title":"J. Comput. Appl. Math."},{"issue":"12","key":"BF02711134_CR18","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/TBME.1981.324681","volume":"28","author":"C. V. Nelsen","year":"1981","unstructured":"C. V. Nelsen and B. C. Hodgkin. Determination of magnitudes, directions, and locations of two independent dipoles in a circular conducting region from boundary potential measurements.IEEE Trans. Biomed. Engrg., 28(12):817\u2013823, 1981.","journal-title":"IEEE Trans. Biomed. Engrg."},{"key":"BF02711134_CR19","unstructured":"P. Pedersen. Private communication, 1994."},{"key":"BF02711134_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos.Computational Geometry: An Introduction. Springer-Verlag, Berlin, 1985."},{"issue":"1","key":"BF02711134_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(93)00062-A","volume":"133","author":"J. M. Rojas","year":"1994","unstructured":"J. M. Rojas. A convex geometric approach to counting the roots of a polynomial system.Theoret. Comput. Sci., 133(1):105\u2013140, 1994.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02711134_CR22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-94-011-0924-6_13","volume-title":"Polytopes: Abstract, Convex and Computational","author":"R. Schneider","year":"1994","unstructured":"R. Schneider. Polytopes and Brunn-Minkowski theory. In R. Schneider, T. Bisztriczky, P. McMullen, and A. I. Weiss, editors.Polytopes: Abstract, Convex and Computational, pages 273\u2013300. Kluwer, Boston, MA, 1994."},{"key":"BF02711134_CR23","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver.Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester, 1986."},{"issue":"2","key":"BF02711134_CR24","first-page":"459","volume":"6","author":"M. Shub","year":"1993","unstructured":"M. Shub and S. Smale. Complexity of B\u00e9zout's theorem, I: Geometric aspects.J. Amer. Math. Soc. 6(2):459\u2013501, 1993.","journal-title":"J. Amer. Math. Soc."},{"key":"BF02711134_CR25","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1022497624378","volume":"3","author":"B. Sturmfels","year":"1994","unstructured":"B. Sturmfels. On the Newton polytope of the resultant.J. Algebraic Combin., 3:207\u2013236, 1994.","journal-title":"J. Algebraic Combin."},{"issue":"3","key":"BF02711134_CR26","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01202036","volume":"4","author":"J. Verschelde","year":"1993","unstructured":"J. Verschelde and R. Cools. Symbolic homotopy construction.Appl. Algebra Engrg. Commun. Comput., 4(3):169\u2013183, 1993.","journal-title":"Appl. Algebra Engrg. Commun. Comput."},{"issue":"1","key":"BF02711134_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/aama.1995.1005","volume":"16","author":"J. Verschelde","year":"1995","unstructured":"J. Verschelde and K. Gatermann. Symmetric Newton polytopes for solving sparse polynomial systems.Adv. in Appl. Math., 16(1):95\u2013127, 1995.","journal-title":"Adv. in Appl. Math."},{"issue":"1","key":"BF02711134_CR28","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(94)00064-6","volume":"133","author":"J. Verschelde","year":"1994","unstructured":"J. Verschelde and A. Haegemans. Homotopies for solving polynomial systems within a bounded domain.Theoret. Comput. Sci., 133(1):141\u2013161, 1994.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"BF02711134_CR29","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/0731049","volume":"31","author":"J. Verschelde","year":"1994","unstructured":"J. Verschelde, P. Verlinden, and R. Cools. Homotopies exploiting Newton polytopes for solving sparse polynomial systems.SIAM J. Numer. Anal., 31(3):915\u2013930, 1994.","journal-title":"SIAM J. Numer. Anal."},{"issue":"2\u20133","key":"BF02711134_CR30","first-page":"143","volume":"51","author":"C. W. Wampler","year":"1992","unstructured":"C. W. Wampler. B\u00e9zout number calculations for multi-homogeneous polynomial systems.Appl. Math. Comput., 51(2\u20133):143\u2013157, 1992.","journal-title":"Appl. Math. Comput."},{"key":"BF02711134_CR31","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/BF01189930","volume":"58","author":"U. Betke","year":"1992","unstructured":"U. Betke. Mixed volumes of polytopes.Arch. Math.,58:388\u2013391, 1992.","journal-title":"Arch. Math."},{"issue":"3","key":"BF02711134_CR32","doi-asserted-by":"crossref","first-page":"527","DOI":"10.2307\/2946575","volume":"135","author":"L. J. Billera","year":"1992","unstructured":"L. J. Billera and B. Sturmfels. Fiber polytopes,Ann of Math., 135(3):527\u2013549, 1992.","journal-title":"Ann of Math."},{"issue":"3","key":"BF02711134_CR33","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0747-7171(08)80153-8","volume":"12","author":"G. Bj\u00f6rk","year":"1991","unstructured":"G. Bj\u00f6rk and R. Fr\u00f6berg. A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclicn-roots.J. Symbolic Comput. 12(3):329\u2013336, 1991.","journal-title":"J. Symbolic Comput."},{"key":"BF02711134_CR34","series-title":"Lecture Notes in Mathematics","first-page":"57","volume-title":"Analysis, Algebra and Computers in Mathematical Research","author":"G. Bj\u00f6rk","year":"1994","unstructured":"G. Bj\u00f6rk and R. Fr\u00f6berg. Methods to \u201cdivide out\u201d certain solutions from systems of algebraic equations, applied to find all cyclic 8-roots. In M. Gyllenberg and L. E. Persson, editors,Analysis, Algebra and Computers in Mathematical Research, pages 57\u201370. Lecture Notes in Mathematics, volume 564, Dekker, New York, 1994."},{"issue":"1","key":"BF02711134_CR35","first-page":"53","volume":"3","author":"A. D. Bryuno","year":"1992","unstructured":"A. D. Bryuno and A. Soleev. Local uniformization of branches of a space curve, and Newton polyhedra.St. Petersburg Math. J., 3(1):53\u201382, 1992. Translated fromAlgebra i Analiz 3(1):67\u2013101, 1991.","journal-title":"St. Petersburg Math. J."},{"key":"BF02711134_CR36","series-title":"Grundlehren der mathematischen Wisenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07441-1","volume-title":"Geometric Inequalities","author":"Yu. D. Burago","year":"1988","unstructured":"Yu. D. Burago and V. A. Zalgaller.Geometric Inequalities, Grundlehren der mathematischen Wisenschaften, volume 285. Springer-Verlag, Berlin, 1988."},{"key":"BF02711134_CR37","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-56686-4_36","volume-title":"Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"J. F. Canny","year":"1993","unstructured":"J. F. Canny and I. Emiris. An efficient algorithm for the sparse mixed resultant.Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pages 89\u2013104. Springer-Verlag, New York, 1993."},{"key":"BF02711134_CR38","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/120694.120707","volume-title":"Proceedings of the 1991International Symposium on Symbolic and Algebraic Computation","author":"J. Canny","year":"1991","unstructured":"J. Canny and J. M. Rojas. An optimal condition for determining the exact number of roots of a polynomial system.Proceedings of the 1991International Symposium on Symbolic and Algebraic Computation, pages 96\u2013101. ACM, New York, 1991."},{"key":"BF02711134_CR39","series-title":"Lecture Notes in Computer Science","first-page":"463","volume-title":"Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 1992","author":"K. L. Clarkson","year":"1992","unstructured":"K. L. Clarkson, K. Melhorn, and R. Seidel. Four results on randomized incremental constructions. In A. Finkel and M. Jantzen, editors,Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 1992, pages 463\u2013474. Lecture Notes in Computer Science, volume 577, Springer-Verlag, Berlin, 1992."},{"issue":"5","key":"BF02711134_CR40","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1137\/0217060","volume":"17","author":"M. E. Dyer","year":"1988","unstructured":"M. E. Dyer and A. M. Frieze. On the complexity of computing the volume of a polyhedron.SIAM J. Comput. 17(5):967\u2013974, 1988.","journal-title":"SIAM J. Comput."},{"key":"BF02711134_CR41","doi-asserted-by":"crossref","unstructured":"M. Dyer, P. Gritzmann, and A. Hufnagel. On the complexity of computing mixed volumes.SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539794278384"},{"key":"BF02711134_CR42","series-title":"ETACS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner.Algorithms in Combinatorial Geometry. ETACS Monographs on Theoretical Computer Science, volume 10, Springer-Verlag, Berlin, 1987."},{"key":"BF02711134_CR43","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/142675.142688","volume-title":"Proceedings of the Eighth Annual Symposium on Computational Geometry","author":"H. Edelsbrunner","year":"1992","unstructured":"H. Edelsbrunner and N. R. Shah. Incremental topological flipping works for regular triangulations.Proceedings of the Eighth Annual Symposium on Computational Geometry, pages 43\u201352. ACM, New York, 1992."},{"key":"BF02711134_CR44","volume-title":"Sparse Elimination and Applications in Kinematics","author":"I. Z. Emiris","year":"1994","unstructured":"I. Z. Emiris. Sparse Elimination and Applications in Kinematics. Ph.D. thesis, Computer Science Division, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, CA, 1994."},{"key":"BF02711134_CR45","series-title":"Technical Report","volume-title":"Efficient incremental algorithms for the sparse resultant and the mixed volume","author":"I. Emiris","year":"1994","unstructured":"I. Emiris and J. Canny. Efficient incremental algorithms for the sparse resultant and the mixed volume. Technical Report 839, Computer Science Division, University of California, Berkeley, CA, 1994. Also inJ. Symbolic Comput., 11(1):1\u201333, 1996."},{"issue":"4","key":"BF02711134_CR46","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0167-8396(94)00018-N","volume":"12","author":"M. A. Facello","year":"1995","unstructured":"M. A. Facello. Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions.Comput. Aided Geom. Design., 12(4):349\u2013370, 1995.","journal-title":"Comput. Aided Geom. Design."},{"key":"BF02711134_CR47","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00054997","volume":"4","author":"O. D. Faugeras","year":"1990","unstructured":"O. D. Faugeras and S. Maybank. Motion from point matches: multiplicity of solutions.Internat. J. Comput. Vision, 4:225\u2013246, 1990.","journal-title":"Internat. J. Comput. Vision"},{"key":"BF02711134_CR48","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson.Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, San Francisco, CA, 1979."},{"key":"BF02711134_CR49","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0001-8708(90)90048-R","volume":"84","author":"I. M. Gelfand","year":"1990","unstructured":"I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. Generalized Euler integrals and A-hypergeometric functions.Adv. in Math., 84:255\u2013271, 1990.","journal-title":"Adv. in Math."},{"key":"BF02711134_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants and Multidimensional Determinants","author":"I. M. Gelfand","year":"1994","unstructured":"I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky,Discriminants, Resultants and Multidimensional Determinants, Birkh\u00e4user, Boston, MA, 1994."},{"key":"BF02711134_CR51","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/B978-0-444-89596-7.50023-7","volume-title":"Handbook of Convex Geometry","author":"P. Gritzmann","year":"1993","unstructured":"P. Gritzmann and V. Klee. Mathematical programming and convex geometry. In P. M. Gruber and J. M. Wills, editors,Handbook of Convex Geometry, volume A, chapter 2.7, pages 627\u2013674. North-Holland, Amsterdam, 1993."},{"key":"BF02711134_CR52","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-94-011-0924-6_17","volume-title":"Polytopes: Abstract, Convex and Computational","author":"P. Gritzmann","year":"1994","unstructured":"P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes. In R. Schneider, T. Bisztriczky, P. McMullen, and A. I. Weiss, editors,Polytopes: Abstract, Convex and Computational, pages 373\u2013466, Kluwer, Boston, MA, 1994."},{"issue":"2","key":"BF02711134_CR53","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0406019","volume":"6","author":"P. Gritzmann","year":"1993","unstructured":"P. Gritzmann and B. Sturmfels. Minkowski addition of polytopes: computational complexity and applications to Gr\u00f6bner bases.SIAM J. Discrete Math., 6(2):246\u2013269, 1993.","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"BF02711134_CR54","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0094-114X(91)90024-X","volume":"26","author":"C. Wampler","year":"1991","unstructured":"C. Wampler and A. Morgan. Solving the 6R inverse position problem using a generic case solution methodology.Mech. Mach. Theory, 26(1):91\u2013106, 1991.","journal-title":"Mech. Mach. Theory"},{"issue":"1","key":"BF02711134_CR55","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1115\/1.2916909","volume":"114","author":"C. W. Wampler","year":"1992","unstructured":"C. W. Wampler, A. P. Morgan, and A. J. Sommese. Complete solution of the nine-point path synthesis problem for four-bar linkages.ASME J. Mech. Design, 114(1):153\u2013159, 1992.","journal-title":"ASME J. Mech. Design"},{"key":"BF02711134_CR56","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G. M. Ziegler","year":"1995","unstructured":"G. M. Ziegler.Lectures on Polytopes. Graduate Texts in Mathematics, volume 152. Springer-Verlag, New York, 1995."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02711134.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02711134\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02711134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T20:53:37Z","timestamp":1558212817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02711134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["BF02711134"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf02711134","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}
