{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:37:05Z","timestamp":1770982625794,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"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":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80009-1","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"357-381","source":"Crossref","is-referenced-by-count":97,"title":["A taxonomy of complexity classes of functions"],"prefix":"10.1016","volume":"48","author":[{"given":"Alan L.","family":"Selman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 6","key":"10.1016\/S0022-0000(05)80009-1_bib1","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1137\/0217075","article-title":"P-printable sets","volume":"17","author":"Allender","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80009-1_bib2","article-title":"NP-Hard Sets Are P-Superterse Unless R = NP","author":"Beigel","year":"1988"},{"key":"10.1016\/S0022-0000(05)80009-1_bib3","series-title":"Proceedings, 3rd IEEE Conference on Structure in Complexity Theory","first-page":"224","article-title":"On truth table reducibility to sat and the difference hierarchy over NP","author":"Buss","year":"1988"},{"key":"10.1016\/S0022-0000(05)80009-1_bib4","series-title":"Proceedings, 4th IEEE Conference on Structure in Complexity Theory","first-page":"225","article-title":"On the power of probabilistic polynomial time","author":"Beigel","year":"1989"},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80009-1_bib5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comp."},{"issue":"No.2","key":"10.1016\/S0022-0000(05)80009-1_bib6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02090768","article-title":"On the power of parity polynomial time","volume":"23","author":"Cai","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80009-1_bib7","series-title":"Proceedings, 3rd ACM Symp. Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80009-1_bib8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","article-title":"The complexity of promise problems with applications to public-key cryptography","volume":"61","author":"Even","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80009-1_bib9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80009-1_bib10","doi-asserted-by":"crossref","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80009-1_bib11","article-title":"Counting in Structural Complexity Theory","author":"Hemachandra","year":"1987"},{"key":"10.1016\/S0022-0000(05)80009-1_bib12","series-title":"Proceedings, 2nd IEEE Conference on Structure in Complexity","first-page":"33","article-title":"PNP[log n]and sparse Turing-complete sets for NP","author":"Kadin","year":"1987"},{"key":"10.1016\/S0022-0000(05)80009-1_bib13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. Systems Sci."},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80009-1_bib14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","article-title":"The difference and truth-table hierarchies for NP","volume":"21","author":"K\u00f6bler","year":"1987","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80009-1_bib15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0207035","article-title":"Polynomial time enumeration reducibility","volume":"7","author":"Selman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80009-1_bib16","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0217062","article-title":"Natural self-reducible sets","volume":"17","author":"Selman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80009-1_bib17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01374525","article-title":"A survey of one-way functions in complexity theory","volume":"25","author":"Selman","year":"1992","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80009-1_bib18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0212037","article-title":"Positive relativizations of complexity classes","volume":"12","author":"Selman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80009-1_bib19","series-title":"Proceedings, 30th IEEE Symp. on Foundations of Computer Science","first-page":"514","article-title":"On the computational power of PP and \u2295P","author":"Toda","year":"1989"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80009-1_bib20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02090391","article-title":"On polynomial-time truth-table reducibilities of intractable sets to P-selective sets","volume":"24","author":"Toda","year":"1991","journal-title":"Math. Systems Theory"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80009-1_bib21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80009-1_bib22","series-title":"Proceedings 17th ACM Symp. Theory of Computing","first-page":"458","article-title":"NP is as easy as detecting unique solutions","author":"Valiant","year":"1985"},{"key":"10.1016\/S0022-0000(05)80009-1_bib23","article-title":"Bounded Query Classes","author":"Wagner","year":"1987"},{"key":"10.1016\/S0022-0000(05)80009-1_bib24","article-title":"Log Query Classes","author":"Wagner","year":"1987"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80009-1_bib25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01202283","article-title":"Structural analysis of the complexity of inverse functions","volume":"26","author":"Watanabe","year":"1993","journal-title":"Math. Systems Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800091?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800091?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:38Z","timestamp":1548196058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800091"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80009-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}