{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:32:04Z","timestamp":1787340724993,"version":"build-2736575974"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1989,12]]},"abstract":"<jats:p>The classes of functions $# \\textit{PSPACE}$ and $\\natural \\textit{PSPACE}$ that are analogous to the class $# P$ are defined. Functions in $# \\textit{PSPACE}$ count the number of accepting computations of a nondeterministic polynomial space bounded Turing machine, and functions in $\\natural \\textit{PSPACE}$ count the number of accepting computations of nondeterministic polynomial space bounded Turing machines that on each computation path make at most a polynomial number of nondeterministic choices. In contrast to what is known about $# P$, exact characterizations of both $# \\textit{PSPACE}$ and $\\natural \\textit{PSPACE}$ are found. In particular, $# PSPACE = FSPACE$ (the class of functions computable in polynomial space) and $\\natural PSPACE = FSPACE (poly)$ (the class of functions computable in polynomial space with output length bounded by a polynomial). Both $# \\textit{PSPACE}$ and $\\natural \\textit{PSPACE}$ can be characterized by counting problems related to alternating Turing machines. Both $# \\textit{PSPACE}$ and $\\natural \\textit{PSPACE}$ have natural complete functions. It is an easy observation that $FP \\subseteq # P \\subseteq \\natural \\textit{PSPACE} $, where $FP$ is the class of functions computable in polynomial time. Relativization to oracles is considered, as are approximation techniques for obtaining a better understanding of whether either of the above inclusions is proper.<\/jats:p>","DOI":"10.1137\/0218073","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:32:44Z","timestamp":1109226764000},"page":"1087-1097","source":"Crossref","is-referenced-by-count":41,"title":["Polynomial Space Counting Problems"],"prefix":"10.1137","volume":"18","author":[{"given":"Richard E.","family":"Ladner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90043-4"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0206054"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R6","volume-title":"The complexity of computing","author":"Savage J.","year":"1976"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0214060"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer, A. R. Meyer,  Word problems requiring exponential time: preliminary report,  Fifth Annual ACM Symposium on Theory of Computing (Austin, Tex., 1973), Assoc. Comput. Mach., New York,  1973,  1\u20139 54:6557","DOI":"10.1145\/800125.804029"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"A. C. Yao,  Separating the polynomial-time hierarchy by oracles,  26th Annual IEEE Symposium on Foundations of Computer Science,  1985,  1\u20135","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0218073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:45:33Z","timestamp":1787337933000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0218073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1137\/0218073"],"URL":"https:\/\/doi.org\/10.1137\/0218073","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}