{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T02:05:49Z","timestamp":1793153149941,"version":"4.5.0"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>The theme of this paper is to investigate to what extent approximation, possibly together with randomization, can reduce the complexity of problems in Valiant\u2019s class # P. In general, any function in # P can be approximated to within any constant factor by a function in the class $\\Delta _3^p $ of the polynomial-time, hierarchy. Relative to a particular oracle, $\\Delta _3^p $ cannot be replaced by $\\Delta _2^p $ in this result. Another part of the paper introduces a model of random sampling where the size of a set X is estimated by checking, for various \u201csample sets\u201d S, whether or not S intersects X For various classes of sample sets, upper and lower bounds on the number of samples required to estimate the size of X are discussed. This type of sampling is motivated by particular problems in # P such as computing the size of a backtrack search tree. In the case of backtrack search trees, a sample amounts to checking whether a certain path exists in the tree. One of the lower bounds suggests that such tests alone are not sufficient to give a polynomial-time approximation algorithm for this problem, even if the algorithm can randomize.<\/jats:p>","DOI":"10.1137\/0214060","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"849-861","source":"Crossref","is-referenced-by-count":143,"title":["On Approximation Algorithms for # P"],"prefix":"10.1137","volume":"14","author":[{"given":"Larry","family":"Stockmeyer","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.1016\/0304-3975(80)90027-4"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"R3","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0206049"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0088907"},{"key":"R6","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft John E.","year":"1979"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby,  Monte-Carlo algorithms for enumeration and reliability problems,  Proc. 24th IEEE Symposium on Foundations of Computer Science,  1983,  56\u201364","DOI":"10.1109\/SFCS.1983.35"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0373371-6"},{"key":"R9","volume-title":"Combinatorial optimization: networks and matroids","author":"Lawler E.","year":"1976"},{"key":"R10","unstructured":"M. Luby, personal communication"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"U. Manber, M. Tompa,  Probabilistic, nondeterministic, and alternating decision trees,  Proc. 14th ACM Symposium on Theory of Computing,  1982,  234\u2013244","DOI":"10.1145\/800070.802197"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0209024"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"M. Sipser,  A complexity theoretic approach to randomness,  Proc. 15th ACM Symposium on Theory of Computing,  1983,  330\u2013335","DOI":"10.1145\/800061.808762"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0206006"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer,  The complexity of approximate counting,  Proc. 15th ACM Symposium on Theory of Computing,  1983,  118\u2013126","DOI":"10.1145\/800061.808740"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:55Z","timestamp":1787337595000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214060"],"URL":"https:\/\/doi.org\/10.1137\/0214060","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}