{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:25:20Z","timestamp":1769840720819,"version":"3.49.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"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,8]]},"DOI":"10.1016\/s0022-0000(05)80082-0","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"1-17","source":"Crossref","is-referenced-by-count":6,"title":["Simple characterizations of P(#P) and complete problems"],"prefix":"10.1016","volume":"49","author":[{"given":"Seinosuke","family":"Toda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80082-0_bib1","article-title":"Counting hierarchies: Polynomial time and constant depth circuits","volume":"40","author":"Allender","year":"1990","journal-title":"EATCS Bull"},{"key":"10.1016\/S0022-0000(05)80082-0_bib2","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/5925.5937","article-title":"The polynomial-time hierarchy and sparse oracles","volume":"33","author":"Balc\u00e1zar","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80082-0_bib3","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/S0022-0000(05)80082-0_bib4","series-title":"Proceedings, 31st IEEE Symposium on Foundations of Computer Science","first-page":"26","article-title":"A characterization of #P by arithmetic straight line programs of polynomials","author":"Babai","year":"1991"},{"key":"10.1016\/S0022-0000(05)80082-0_bib5","series-title":"Proceedings, 3rd ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexicy of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(05)80082-0_bib6","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80082-0_bib7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(05)80082-0_bib8","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/322092.322097","article-title":"Lower bounds for selecting in X + Y and other multisets","volume":"25","author":"Johnson","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80082-0_bib9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","article-title":"Selecting the Kth element in X + Y and X1 + X2 + \u2026 + Xm","volume":"7","author":"Johnson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80082-0_bib10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(05)80082-0_bib11","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. System Sci."},{"key":"10.1016\/S0022-0000(05)80082-0_bib12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","article-title":"On counting and approximation","volume":"26","author":"K\u00f6bler","year":"1989","journal-title":"Acta Inform"},{"key":"10.1016\/S0022-0000(05)80082-0_bib13","series-title":"Proceedings, 13th Symposium on Mathematical Foundations of Computer Science","first-page":"454","article-title":"\u0394P2-complete lexicographically first maximal subgraph problems","volume":"Vol. 324","author":"Miyano","year":"1988"},{"key":"10.1016\/S0022-0000(05)80082-0_bib14","unstructured":"M. Ogiwara, A characterization of PC=P, Trans. IEICE, in press."},{"key":"10.1016\/S0022-0000(05)80082-0_bib15","series-title":"Proceedings 6th IEEE Conference on Structure in Complexity Theory","first-page":"16","article-title":"A complexity theory for feasible closure properties","author":"Ogiwara","year":"1991"},{"key":"10.1016\/S0022-0000(05)80082-0_bib16","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0022-0000(05)80082-0_bib17","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the complexity of unique solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80082-0_bib18","first-page":"480","article-title":"On the difference between one and many","volume":"Vol. 52","author":"Simon","year":"1977"},{"key":"10.1016\/S0022-0000(05)80082-0_bib19","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":"Theor. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80082-0_bib20","series-title":"Proceedings, 30th IEEE Symposium on Foundations of Computer Science","first-page":"514","article-title":"On the computational power of PP and \u2295P","author":"Toda","year":"1989"},{"key":"10.1016\/S0022-0000(05)80082-0_bib21","doi-asserted-by":"crossref","unstructured":"S. Toda and O. Watanabe, Polynomial time 1-Turing reductions from #PH to #P, Theor. Comput. Sci., in press.","DOI":"10.1016\/0304-3975(92)90369-Q"},{"key":"10.1016\/S0022-0000(05)80082-0_bib22","series-title":"Proceedings, 3rd IEEE Conference on Structure in Complexity Theory","first-page":"213","article-title":"An oracle characterization of the counting hierarchy","author":"Tor\u00e1n","year":"1988"},{"key":"10.1016\/S0022-0000(05)80082-0_bib23","article-title":"Structural Properties of the Counting Hierarchies","author":"Tor\u00e1n","year":"1988"},{"key":"10.1016\/S0022-0000(05)80082-0_bib24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80082-0_bib25","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80082-0_bib26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Inform"},{"key":"10.1016\/S0022-0000(05)80082-0_bib27","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":"Theor. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80082-0_bib28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theor. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800820?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800820?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T06:00:23Z","timestamp":1706508023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["S0022000005800820"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80082-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}