Majorizing estimators and the approximation of #P-complete problems

DOI10.1145/301250.301320zbMath1346.68114OpenAlexW2041579332MaRDI QIDQ2819556

Leonard J. Schulman, Vijay V. Vazirani

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301320

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Majorizing estimators and the approximation of #P-complete problems