Translator Disclaimer
September 2007 Approximate counting in bounded arithmetic
Emil Jeřábek
J. Symbolic Logic 72(3): 959-993 (September 2007). DOI: 10.2178/jsl/1191333850

Abstract

We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV)), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP, APP, MA, AM) in PV1 + dWPHP(PV).

Citation

Download Citation

Emil Jeřábek. "Approximate counting in bounded arithmetic." J. Symbolic Logic 72 (3) 959 - 993, September 2007. https://doi.org/10.2178/jsl/1191333850

Information

Published: September 2007
First available in Project Euclid: 2 October 2007

zbMATH: 1123.03051
MathSciNet: MR2354909
Digital Object Identifier: 10.2178/jsl/1191333850

Subjects:
Primary: 03F30
Secondary: 68W20

Keywords: bounded arithmetic , counting , pigeonhole principle , randomized algorithms

Rights: Copyright © 2007 Association for Symbolic Logic

JOURNAL ARTICLE
35 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.72 • No. 3 • September 2007
Back to Top