{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:08:46Z","timestamp":1762099726112},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0020-0190(79)90079-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"1-4","source":"Crossref","is-referenced-by-count":28,"title":["Efficient search for rationals"],"prefix":"10.1016","volume":"8","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1963","series-title":"Linear programming and extensions","author":"Dantzig","key":"10.1016\/0020-0190(79)90079-6_BIB1"},{"year":"1960","series-title":"An introduction to the theory of numbers","author":"Hardy","key":"10.1016\/0020-0190(79)90079-6_BIB2"},{"key":"10.1016\/0020-0190(79)90079-6_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0012-365X(73)90171-4","article-title":"The simplex algorithm with the pivot rule of maximizing criterion improvement","volume":"4","author":"Jeroslaw","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(79)90079-6_BIB4","series-title":"Inequalities-III","first-page":"159","article-title":"How good is the simplex algorithm","author":"Klee","year":"1972"},{"key":"10.1016\/0020-0190(79)90079-6_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"journal-title":"Combinatorial Optimization Algorithms","year":"1978","author":"Papadimitriou","key":"10.1016\/0020-0190(79)90079-6_BIB6"},{"issue":"3","key":"10.1016\/0020-0190(79)90079-6_BIB7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. on Computing"},{"key":"10.1016\/0020-0190(79)90079-6_BIB8","article-title":"The complexity of linear programming","author":"Reiss","year":"1976","journal-title":"Yale Technical Report"},{"issue":"3","key":"10.1016\/0020-0190(79)90079-6_BIB9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","article-title":"A bad network problem for simplex method and other minimum cost flow algorithms","volume":"5","author":"Zadeh","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0020-0190(79)90079-6_BIB10","unstructured":"S. Reiss, private communication, March 1978."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:20Z","timestamp":1555072100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0020019079900796"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90079-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}