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)
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On counting propositional logic and Wagner's hierarchy;Theoretical Computer Science;2023-07
2. 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
3. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Approximate counting and NP search problems;Journal of Mathematical Logic;2022-06-22