{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T21:32:17Z","timestamp":1665523937957},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0304-3975(95)00237-5","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"245-258","source":"Crossref","is-referenced-by-count":6,"title":["Recursion theoretic characterizations of complexity classes of counting functions"],"prefix":"10.1016","volume":"163","author":[{"given":"Heribert","family":"Vollmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus W.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00237-5_BIB1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01200057","article-title":"Arithmetization: A new method in structural complexity theory","volume":"1","author":"Babai","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/0304-3975(95)00237-5_BIB2","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1995"},{"key":"10.1016\/0304-3975(95)00237-5_BIB3","series-title":"Feasible Mathematics","first-page":"49","article-title":"Sequential, machine independent characterizations of the parallel complexity classes AlogTIME, ACk, NCk and NC","author":"Clote","year":"1990"},{"key":"10.1016\/0304-3975(95)00237-5_BIB4","series-title":"Proc. 5th Structure in Complexity Theory Conf.","first-page":"186","article-title":"Bounded arithmetic and computational complexity","author":"Clote","year":"1990"},{"key":"10.1016\/0304-3975(95)00237-5_BIB5","series-title":"Proc. 1964 Internat. Conf. on Logic, Methodology and Philosophy of Science","first-page":"24","article-title":"The intrinsic computational complexity of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/0304-3975(95)00237-5_BIB6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/2266325","article-title":"Arithmetical problems and recursively enumerable predicates","volume":"18","author":"Davis","year":"1953","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00237-5_BIB7","series-title":"SIAM-AMS Proc.","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"Vol. 7","author":"Fagin","year":"1974"},{"key":"10.1016\/0304-3975(95)00237-5_BIB8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0022-0000(05)80024-8","article-title":"Gap-definable counting classes","volume":"48","author":"Fenner","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic complexity classes","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00237-5_BIB10","series-title":"Proc. 10th Structure in Complexity Theory Conf.","first-page":"299","article-title":"On the power of number-theoretic operations with respect to counting","author":"Hertrampf","year":"1995"},{"key":"10.1016\/0304-3975(95)00237-5_BIB11","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0022-0000(83)90048-X","article-title":"A normal for arithmatical representations of NP-sets","volume":"27","author":"Hodgson","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00237-5_BIB13","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00237-5_BIB14","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","article-title":"Expressibility and parallel complexity","volume":"18","author":"Immerman","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00237-5_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(82)90076-7","article-title":"An arithmetical characterization of NP","volume":"21","author":"Kent","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(93)90006-I","article-title":"A complexity theory for feasible closure properties","volume":"46","author":"Ogiwara","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB17","series-title":"Proc. 7th Structure in Complexity Theory Conf.","first-page":"169","article-title":"Descriptive complexity of #P functions","author":"Saluja","year":"1992"},{"key":"10.1016\/0304-3975(95)00237-5_BIB18","series-title":"Proc. 31st Symp. on Foundations of Computer Science","first-page":"11","article-title":"IP = PSPAGE","author":"Shamir","year":"1990"},{"key":"10.1016\/0304-3975(95)00237-5_BIB19","series-title":"Proc. 14th Symp. on the Theory of Computing","first-page":"603","article-title":"The history and status of the P versus NP question","author":"Sipser","year":"1992"},{"key":"10.1016\/0304-3975(95)00237-5_BIB20","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF01206638","article-title":"On closure properties of Gap-P","volume":"4","author":"Thierauf","year":"1994","journal-title":"Comput. Complexity"},{"key":"10.1016\/0304-3975(95)00237-5_BIB21","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00237-5_BIB22","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluation","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00237-5_BIB23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB24","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1006\/inco.1995.1109","article-title":"Complexity classes of optimization function","volume":"120","author":"Vollmer","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00237-5_BIB25","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(86)90141-6","article-title":"Some observations on the connection between counting and recursion","volume":"47","author":"Wagner","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00237-5_BIB26","series-title":"Computational Complexity","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:54:02Z","timestamp":1555419242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595002375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0304397595002375"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00237-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}