{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:25:54Z","timestamp":1762295154758},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,2,1]],"date-time":"1982-02-01T00:00:00Z","timestamp":381369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11489,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,2]]},"DOI":"10.1016\/0022-0000(82)90053-8","type":"journal-article","created":{"date-parts":[[2004,1,6]],"date-time":"2004-01-06T05:48:13Z","timestamp":1073368093000},"page":"15-35","source":"Crossref","is-referenced-by-count":29,"title":["The maximum value problem and NP real numbers"],"prefix":"10.1016","volume":"24","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90053-8_BIB1","series-title":"Proceedings, IEEE Symposium, on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0022-0000(82)90053-8_BIB2","series-title":"Proceedings, Fifth International Coll. on Auto. Lang. and Programming","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","author":"Berman","year":"1978"},{"key":"10.1016\/0022-0000(82)90053-8_BIB3","series-title":"Proceedings, Third ACM Symp. on Theory of Comp.","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(82)90053-8_BIB4","series-title":"Constructivity in Mathematics","first-page":"43","article-title":"Some approaches to constructive analysis","author":"Grzegorczyk","year":"1959"},{"key":"10.1016\/0022-0000(82)90053-8_BIB5","series-title":"Complexity of Computation","first-page":"1","article-title":"The LBA problem and its importance in the theory of computing","author":"Hartmanis","year":"1974"},{"key":"10.1016\/0022-0000(82)90053-8_BIB6","doi-asserted-by":"crossref","unstructured":"K. Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci., in press.","DOI":"10.1007\/978-1-4684-6802-1_3"},{"key":"10.1016\/0022-0000(82)90053-8_BIB7","series-title":"Tech. Report, UH-CS80-3","article-title":"On the Definitions of Some Complexity Classes of Real Numbers","author":"Ko","year":"1980"},{"issue":"1","key":"10.1016\/0022-0000(82)90053-8_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90053-8_BIB9","series-title":"Proceedings, 21st Symp. on Foundations of Computer Science","first-page":"54","article-title":"Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis","author":"Mahaney","year":"1980"},{"key":"10.1016\/0022-0000(82)90053-8_BIB10","series-title":"Proceedings, 13th IEEE Symp. Switch. and Auto. Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"issue":"3","key":"10.1016\/0022-0000(82)90053-8_BIB11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/321765.321772","article-title":"Toward abstract numerical analysis","volume":"20","author":"Miller","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90053-8_BIB12","first-page":"280","article-title":"Review of R. Peter's \u201cRecursive Funktionen\u201d","volume":"16","author":"Robinson","year":"1951","journal-title":"J. Symbolic Logic."},{"key":"10.1016\/0022-0000(82)90053-8_BIB13","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(82)90053-8_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","article-title":"Nicht konstruktiv beweisbare S\u00e4tze der Analysis","volume":"14","author":"Specker","year":"1949","journal-title":"J. Symbolic Logic."},{"issue":"1","key":"10.1016\/0022-0000(82)90053-8_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T14:23:29Z","timestamp":1550240609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,2]]}},"alternative-id":["0022000082900538"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90053-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,2]]}}}