乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T15:06:59Z","timestamp":1673622419993},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":9908,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0885-064x(86)90014-2","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"95-120","source":"Crossref","is-referenced-by-count":7,"title":["On the computational complexity of best Chebyshev approximations"],"prefix":"10.1016","volume":"2","author":[{"given":"Ker-I","family":"Ko","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(86)90014-2_BIB1","series-title":"Introduction to Approximation Theory","author":"Cheney","year":"1982"},{"key":"10.1016\/0885-064X(86)90014-2_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0001-8708(84)90019-7","article-title":"On the computational complexity of maximization and integration","volume":"53","author":"Friedman","year":"1984","journal-title":"Adv. in Math."},{"key":"10.1016\/0885-064X(86)90014-2_BIB3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0885-064X(86)90014-2_BIB4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01934908","article-title":"A note on the Complexity of an algorithm for Chebyshev approximation","volume":"24","author":"Goldstein","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0885-064X(86)90014-2_BIB5","series-title":"Proceedings of 15th ACM Symposium on Theory of Computing","first-page":"382","article-title":"Sparse sets in NP-P: EXPTIME versus NEXPTIME","author":"Hartmanis","year":"1983"},{"key":"10.1016\/0885-064X(86)90014-2_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0885-064X(86)90014-2_BIB7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-0000(82)90053-8","article-title":"The maximum value problem and NP real numbers","volume":"24","author":"Ko","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0885-064X(86)90014-2_BIB8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01744572","article-title":"On the definitions of some complexity classes of real numbers","volume":"16","author":"Ko","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0885-064X(86)90014-2_BIB9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0019-9958(83)80062-X","article-title":"On the computational complexity of ordinary differential equations","volume":"58","author":"Ko","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0885-064X(86)90014-2_BIB10","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0885-064X(85)90012-3","article-title":"Continuous optimization problems and a polynomial hierarchy of real functions","volume":"1","author":"Ko","year":"1985","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(86)90014-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/0168-0072(86)90005-9","article-title":"Approximation to measurable functions and its relation to probabilistic computation","author":"Ko","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0885-064X(86)90014-2_BIB12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","article-title":"Computational complexity of real functions","volume":"20","author":"Ko","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0885-064X(86)90014-2_BIB13","first-page":"625","article-title":"The application of pure recursion theory to recursive analysis","volume":"28","author":"Nerode","year":"1985","journal-title":"Acta Math. Sinica"},{"key":"10.1016\/0885-064X(86)90014-2_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/malq.19750210102","article-title":"On a simple definition of computable functions of a real variable\u2014with applications to functions of a complex variable","volume":"23","author":"Pour-el","year":"1975","journal-title":"Z. Math. Logik Grundlag Math."},{"key":"10.1016\/0885-064X(86)90014-2_BIB15","series-title":"The Approximation of Functions","author":"Rice","year":"1964"},{"key":"10.1016\/0885-064X(86)90014-2_BIB16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and the p-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0885-064X(86)90014-2_BIB17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/malq.19760220148","article-title":"On the definition of computable functions of a real variable","volume":"22","author":"Shepherdson","year":"1976","journal-title":"Z. Math. Logik Grundlag Math."},{"key":"10.1016\/0885-064X(86)90014-2_BIB18","series-title":"Constructivity in Mathematics","first-page":"254","article-title":"Der Satz von Maximum in der rekursiven Analysis","author":"Specker","year":"1959"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T20:58:51Z","timestamp":1549227531000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X86900142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0885064X86900142"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(86)90014-2","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}