Approximate counting in bounded arithmetic-Reference-Cited by-同舟云学术

Approximate counting in bounded arithmetic

Published:2007-09 Issue:3 Volume:72 Page:959-993
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Jeřábek Emil

Abstract

AbstractWe 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).

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference28 articles.

1. Structures interpretable in models of bounded arithmetic

2. Thapen Neil , The weak pigeonhole principle in models of bounded arithmetic, Ph.D. thesis, Oxford University, 2002.

3. BPP and the polynomial hierarchy

4. Bounded arithmetic and the polynomial hierarchy

Cited by 55 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the existence of strong proof complexity generators;The Bulletin of Symbolic Logic;2023-11-22

2. On counting propositional logic and Wagner's hierarchy;Theoretical Computer Science;2023-07

3. On the Consistency of Circuit Lower Bounds for Non-deterministic Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02