{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:54:35Z","timestamp":1778586875973,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf01188714","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T10:55:44Z","timestamp":1108724144000},"page":"436-457","source":"Crossref","is-referenced-by-count":8,"title":["Polynomial algorithms for linear programming over the algebraic numbers"],"prefix":"10.1007","volume":"12","author":[{"given":"I.","family":"Adler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. A.","family":"Beling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01581077","volume":"57","author":"I. Adler","year":"1992","unstructured":"I. Adler and P. A. Beling, Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices,Mathematical Programming 57 (1992), 121?143.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"I. Adler and P. A. Beling, Turing Algorithms for Linear Programming over the Algebraic Numbers, manuscript, September, 1992.","DOI":"10.1145\/129712.129760"},{"key":"CR3","volume-title":"Ph.D. dissertation","author":"P. A. Beling","year":"1991","unstructured":"P. A. Beling, Linear Programming over the Algebraic Numbers, Ph.D. dissertation, University of California, Berkeley, 1991."},{"issue":"1","key":"CR4","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, On a Theory of Computation and Complexity over the Real Numbers; NP-completeness, Recursive Functions and Universal Machines,Bulletin of the AMS 21(1) (1989), 1?46.","journal-title":"Bulletin of the AMS"},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Grotschel","year":"1988","unstructured":"M. Grotschel, L. Lovasz, and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988."},{"key":"CR6","volume-title":"A Classical Introduction to modern Number Theory","author":"K. Ireland","year":"1972","unstructured":"K. Ireland and M. Rosen,A Classical Introduction to modern Number Theory, Springer-Verlag, New York, 1972."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A New Polynomial Time Algorithm for Linear Programming,Combinatorica 4 (1984), 373?395.","journal-title":"Combinatorica"},{"key":"CR8","first-page":"191","volume":"20","author":"L. Khachiyan","year":"1979","unstructured":"L. Khachiyan, A Polynomial Algorithm in Linear Programming,Soviet Mathematics Doklady 20 (1979), 191?194.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Covexity","author":"L. Lovasz","year":"1986","unstructured":"L. Lovasz,An Algorithmic Theory of Numbers, Graphs and Covexity, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1986."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/0212022","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Towards a Genuinely Polynomial Algorithm for Linear Programming,SIAM Journal on Computing 12(2) (1983), 347?353.","journal-title":"SIAM Journal on Computing"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo, Linear Programming in Linear Time when the Dimension is Fixed,Journal of the Association for Computing Machinery 31 (1984), 114?127.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR12","first-page":"35","volume-title":"Contemporary mathematics, Vol. 114","author":"N. Megiddo","year":"1990","unstructured":"N. Megiddo, On Solving the Linear Programming Problem Approximately,Contemporary mathematics, Vol. 114, The American Mathematical Society, Providence, RI, 1990, pp. 35?50."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-7091-7551-4_16","volume-title":"Computer Algebra","author":"M. Mignotte","year":"1983","unstructured":"M. Mignotte, Some Useful Bounds, in: B. Buchberger, G. E. Collins, and R. Loos (eds.),Computer Algebra, Springer-Verlag, Wien, 1983, pp. 259?263."},{"key":"CR14","unstructured":"C. Norton, S. Plotkin, and E. Tardos, using Separation Algorithms in Fixed Dimension,Proceedings of the 1st ACM\/SIAM Symposium on Discrete Algorithms, 1990, pp. 377?387."},{"key":"CR15","volume-title":"Combinatorial Optimization","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"CR16","doi-asserted-by":"crossref","DOI":"10.5948\/9781614440093","volume-title":"The Theory of Algebraic numbers","author":"H. Pollard","year":"1975","unstructured":"H. Pollard and H. G. Diamond,The Theory of Algebraic numbers, 2nd edn., The Mathematical Association of America, Washington, DC, 1975.","edition":"2nd edn."},{"key":"CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9783110889055","volume-title":"Transcendental Numbers","author":"A. B. Shidlovskii","year":"1989","unstructured":"A. B. Shidlovskii,Transcendental Numbers, de Gruyter, Berlin, 1989."},{"key":"CR18","volume-title":"Algebraic Number Theory","author":"I. N. Stewart","year":"1987","unstructured":"I. N. Stewart and D. O. Tall,Algebraic Number Theory, Chapman & Hall, New York, 1987."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"E. Tardos, A Strongly Polynomial Algorithm To Solve Combinatorial Linear Programs,Opterations Research 34 (1986), 250?256.","journal-title":"Opterations Research"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(82)90047-5","volume":"1","author":"J. F. Traub","year":"1982","unstructured":"J. F. Traub and H. Wozniakowski, Complexity of Linear Programming,Operations Research Letters 1 (1982), 59?62.","journal-title":"Operations Research Letters"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188714\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:50:47Z","timestamp":1586119847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF01188714"],"URL":"https:\/\/doi.org\/10.1007\/bf01188714","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}