ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Majorizing estimators and the approximation of #P-complete problems
Full text PdfPdf (584 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-first annual ACM symposium on Theory of computing table of contents
Atlanta, Georgia, United States
Pages: 288 - 294  
Year of Publication: 1999
ISBN:1-58113-067-8
Authors
Leonard J. Schulman  College of Computing, Georgia Inst. Technology, Atlanta GA
Vijay V. Vazirani  College of Computing, Georgia Inst. Technology, Atlanta GA
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/301250.301320
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Thomas M. Cover , Joy A. Thomas, Elements of information theory, Wiley-Interscience, New York, NY, 1991
 
2
H. Cramer. A contribution to the theory of statistical estoimation. Skandinavisk Aktuarietidskri}t, 29:85-94, 1946.
 
3
M. Frechet. sur l'extension de certain evaluations statistique au cas des petit echantillons. Rev. Inst. Star., 1I:182-205, 1943.
 
4
N. Karmarkar , R. Karp , R. Lipton , L. Lovász , M. Luby, A Monte-Carlo algorithm for estimating the permanent, SIAM Journal on Computing, v.22 n.2, p.284-293, April 1993  [doi>10.1137/0222021]
 
5
Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
 
6
C. R. Rao. Information and accuracy attainable in estimation of statistical parameters. Bull. Cal. Math. $oc., 37:81-91, 1945.
 
7
Alistair Sinclair, Algorithms for random generation and counting: a Markov chain approach, Birkhauser Verlag, Basel, Switzerland, 1993
 
8
S. Zacks. Parametric Statistical Inference. Pergamon Press, 1981.

CITED BY
Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar, Sampling algorithms: lower bounds and applications, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.266-275, July 2001, Hersonissos, Greece

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.3 Complexity Measures and Classes
          Subjects: Reducibility and completeness

  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Counting problems


General Terms:
Algorithms, Design, Performance, Theory, Verification

Collaborative Colleagues:
Leonard J. Schulman: colleagues
Vijay V. Vazirani: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player