On Approximation Algorithms for # P

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1985 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 14, pages 849-861 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Larry J. Stockmeyer;

doi: 10.1137/0214060

On Approximation Algorithms for # P

- Summary
- Subjects
- Metrics

Abstract

It is shown that any function in Valiant's class {\#}P can be approximated to within any constant factor by a function in the class \(\Delta^ P_ 3\) of the polynomial-time hierarchy. A model of random sampling is introduced and discussed in detail. The paper is of interest to specialists in the theory of algorithmic complexity.

Keywords

polynomial- time hierarchy, Analysis of algorithms and problem complexity, random sampling, relativization, probabilistic algorithms, Valiant's class

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	124
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%