{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:14:10Z","timestamp":1680437650691},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1007\/bf01581699","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:42:27Z","timestamp":1114681347000},"page":"263-309","source":"Crossref","is-referenced-by-count":2,"title":["Formulation of linear problems and solution by a universal machine"],"prefix":"10.1007","volume":"65","author":[{"given":"B. Curtis","family":"Eaves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel G.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"E. Balas, \u201cDisjunctive programming: properties of the convex hulls of feasible points,\u201d unpublished manuscript, (1974)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub and S. Smale, \u201cOn the theory of computation and complexity over the real numbers: NP-completeness recursive functions and universal machines,\u201dBulletin (New Series) of the American Mathematical Society 21 (1989) 1\u201346.","journal-title":"Bulletin (New Series) of the American Mathematical Society"},{"key":"CR3","first-page":"515","volume-title":"Lecture Notes in Computer Science 33","author":"G. Collins","year":"1975","unstructured":"G. Collins, \u201cQuantifier elimination for real closed fields by cylindrical algebraic decomposition,\u201d in:Lecture Notes in Computer Science 33 (Springer Verlag, New York, 1975) pp. 515\u2013532."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BF01588957","volume":"14","author":"B.C. Eaves","year":"1978","unstructured":"B.C. Eaves, \u201cA finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set,\u201dMathematical Programming 14 (1978) 122\u2013124.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0326023","volume":"26","author":"B.C. Eaves","year":"1988","unstructured":"B.C. Eaves and U.G. Rothblum, \u201cInvariant polynomial curves of piecewise linear maps,\u201dSIAM Journal on Control and Optimization 26 (1988) 401\u2013416.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1287\/moor.14.3.502","volume":"14","author":"B.C. Eaves","year":"1989","unstructured":"B.C. Eaves and U.G. Rothblum, \u201cA theory on extending algorithms for parametric problems,\u201dMathematics of Operations Research 14 (1989) 502\u2013533.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01585709","volume":"53","author":"B.C. Eaves","year":"1992","unstructured":"B.C. Eaves and U.G. Rothblum, \u201cDines\u2014Fourier\u2014Motzkin quantifier-elimination and applications of corresponding transfer principles over ordered fields,\u201dMathematical Programming 53 (1992a) 307\u2013321.","journal-title":"Mathematical Programming"},{"key":"CR8","unstructured":"B.C. Eaves and U.G. Rothblum, \u201cFormulation of linear problems and solution by a universal machine,\u201d Technical Report, Stanford University, Department of Operations Research (1992b)."},{"key":"CR9","unstructured":"B.C. Eaves and U.G. Rothblum, \u201cLinear problems and randomized linear algorithms,\u201d Technical report, Stanford University, Department of Operations Research (1994)."},{"key":"CR10","volume-title":"A Mathematical Introduction to Logic","author":"H.B. Enderton","year":"1970","unstructured":"H.B. Enderton,A Mathematical Introduction to Logic (Academic Press, New York, 1970)."},{"key":"CR11","first-page":"27","volume-title":"Complexity of Computations, SIAM-AMS Proceedings 7","author":"M. Fischer","year":"1974","unstructured":"M. Fischer and M. Rabin, \u201cSuper-exponential complexity for Presburger arithmetic,\u201dComplexity of Computations, SIAM-AMS Proceedings 7 (American Mathematical Society, Providence, RI, 1974) pp. 27\u201341."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1080\/00029890.1991.12000794","volume":"98","author":"D. Flath","year":"1991","unstructured":"D. Flath and S. Wagon, \u201cHow to pick out the integers in the rationals: an application of number theory to logic,\u201dAmerican Mathematical Monthly 98 (1991) 812\u2013823.","journal-title":"American Mathematical Monthly"},{"key":"CR13","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 (W.H. Freeman and Company, San Francisco, CA, 1979)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0747-7171(88)80006-3","volume":"5","author":"D. Yu. Grigor'ev","year":"1988","unstructured":"D. Yu. Grigor'ev, \u201cThe complexity of deciding Tarski algebra,\u201dJournal of Symbolic Computation 5 (1988) 65\u2013108.","journal-title":"Journal of Symbolic Computation"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1080\/00029890.1991.11995778","volume":"98","author":"J.P. Jones","year":"1991","unstructured":"J.P. Jones and Y.V. Matijasevi\u010d, \u201cProof of recursive unsolvability of Hilbert's tenth problem,\u201dAmerican Mathematical Monthly 98 (1991) 689\u2013709.","journal-title":"American Mathematical Monthly"},{"key":"CR16","volume-title":"Algebra","author":"S. MacLane","year":"1967","unstructured":"S. MacLane and G. Birkhoff,Algebra (Chelsea Publishing Company, New York, N.Y., 1967)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"3","author":"J. Renegar","year":"1992","unstructured":"J. Renegar, \u201cOn the computational complexity and geometry of the first-order theory of the reals,\u201d Parts I, II and III,Journal of Symbolic Computation 3 (1992) 255\u2013352.","journal-title":"Journal of Symbolic Computation"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.2307\/1969640","volume":"60","author":"A. Seidenberg","year":"1954","unstructured":"A. Seidenberg, \u201cA new decision method for elementary algebra,\u201dAnnals of Mathematics 60 (1954) 365\u2013374.","journal-title":"Annals of Mathematics"},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"A. Tarski,A Decision Method for Elementary Algebra and Geometry, Second edition, revised (University of California Press, Berkely, CA, 1951).","edition":"Second edition,"},{"issue":"B","key":"CR20","first-page":"19","volume":"33","author":"L. Dries van den","year":"1981","unstructured":"L. van den Dries, \u201cQuantifier elimination for linear formulas over ordered and valued fields,\u201dBulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de Belgique 33, serie B (1981) 19\u201333.","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de Belgique"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0747-7171(88)80003-8","volume":"5","author":"V. Weispfenning","year":"1988","unstructured":"V. Weispfenning, \u201cThe complexity of linear problems in fields,\u201dJournal of Symbolic Computation 5 (1988) 32\u201327.","journal-title":"Journal of Symbolic Computation"},{"key":"CR22","first-page":"19","volume-title":"Contributions to the Theory of Games, Annals of Mathematical Studies1, no. 24","author":"H. Weyl","year":"1950","unstructured":"H. Weyl, \u201cElementary proof of a minimax theorem due to von Neumann\u201d, in:Contributions to the Theory of Games, Annals of Mathematical Studies1, no. 24, Eds. H.W. Kuhn and A.W. Tucker (Princeton University Press, Princeton, NJ, 1950) pp. 19\u201325."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581699.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581699\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T03:06:40Z","timestamp":1625886400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01581699"],"URL":"https:\/\/doi.org\/10.1007\/bf01581699","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}