Skip to main content Accessibility help
×
×
Home

Approximate counting in bounded arithmetic

  • Emil Jeřábek (a1)
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).

Copyright
References
Hide All
[1]Babai, László, Trading group theory for randomness, Proceedings of the ACM Symposium on Theory of Computing, 1985, pp. 421429.
[2]Babai, László and Moran, Shlomo, Arthur–Merlin games: A randomized proof system, and a hierarchy of complexity classes, Journal of Computer and System Sciences, vol. 36 (1988), no. 2, pp. 254276.
[3]Bennett, Charles H. and Gill, John, Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1, SIAM Journal on Computing, vol. 10 (1981), no. 1, pp. 96113.
[4]Bishop, Errett and Bridges, Douglas S., Constructive Analysis, Grundlehren der mathematischen Wissenschaften, vol. 279, Springer, 1985.
[5]Bovet, Daniel P., Crescenzi, Pierluigi, and Silvestri, Riccardo, A uniform approach to define complexity classes, Theoretical Computer Science, vol. 104 (1992), no. 2, pp. 263283.
[6]Buss, Samuel R., Bounded Arithmetic, Bibliopolis, Naples, 1986.
[7]Buss, Samuel R., Relating the bounded arithmetic and polynomial time hierarchies, Annals of Pure and Applied Logic, vol. 75 (1995), no. 1–2, pp. 6777.
[8]Buss, Samuel R., First-order proof theory of arithmetic, Handbook of Proof Theory (Buss, Samuel R., editor), Studies in Logic and the Foundations of Mathematics, vol. 137, Elsevier, Amsterdam, 1998, pp. 79147.
[9]Cook, Stephen A., Feasibly constructive proofs and the propositional calculus, Proceedings of the ACM Symposium on Theory of Computing, ACM, 1975, pp. 8397.
[10]Cook, Stephen A., Relating the provable collapse of P to NC1 and the power of logical theories, Proof Complexity and Feasible Arithmetics (Bearne, Paul and Buss, Samuel R., editors), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 39, American Mathematical Society, 1998, pp. 7392.
[11]Cook, Stephen A., Theories for complexity classes and their propositional translations, Complexity of Computations and Proofs (Krajíček, Jan, editor), Quaderni di Matematica, vol. 13, Seconda Universita di Napoli, 2004. pp. 175227.
[12]Gill, John, Computational complexity of probabilistic Turing machines, SIAM Journal on Computing, vol. 6 (1977), no. 4, pp. 675695.
[13]Hájek, Petr and Pudlák, Pavel, Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic, Springer, 1993, second edition 1998.
[14]Hartmanis, Juris and Hemachandra, Lane A., Complexity classes without machines: On complete languages for UP, Theoretical Computer Science, vol. 58 (1988), pp. 129142.
[15]Jeřábek, Emil, Dual weak pigeonhole principle, Boolean complexity, and derandomization, Annals of Pure and Applied Logic, vol. 129 (2004). pp. 137.
[16]Jeřábek, Emil, The strength of sharply bounded induction, Mathematical Logic Quarterly, vol. 52 (2006), no. 6, pp. 613624.
[17]Jeřábek, Emil, On independence of variants of the weak pigeonhole principle, submitted, 2006.
[18]Kabanets, Valentine, Rackoff, Charles, and Cook, Stephen A., Efficiently approximable real-valued functions, Technical Report TR00-034, Electronic Colloquium on Computational Complexity, 2000.
[19]Krajíček, Jan, Bounded arithmetic, propositional logic, and complexity theory, Encyclopedia of Mathematics and Its Applications, vol. 60, Cambridge University Press, 1995.
[20]Krajíček, Jan, Pudlák, Pavel, and Takeuti, Gaisi, Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic, vol. 52 (1991), no. 1-2, pp. 143153.
[21]Lautemann, Clemens, BPP and the polynomial hierarchy, Information Processing Letters, vol. 17 (1983), no. 4, pp. 215217.
[22]Maciel, Alexis, Pitassi, Toniann, and Woods, Alan R., A new proof of the weak pigeonhole principle, Journal of Computer and System Sciences, vol. 64 (2002). no. 4, pp. 843872.
[23]Nisan, Noam and Wigderson, Avi, Hardness vs. randomness, Journal of Computer and System Sciences, vol. 49 (1994). no. 2, pp. 149167.
[24]Paris, Jeff B., Wilkie, Alex J., and Woods, Alan R., Provability of the pigeonhole principle and the existence of infinitely many primes, this Journal, vol. 53 (1988), no. 4, pp. 12351244.
[25]Riis, Søren M., Making infinite structures finite in models of second order bounded arithmetic, Arithmetic, proof theory, and computational complexity (Clote, Peter and Krajíček, Jan, editors), Oxford Logic Guides, vol. 23, Oxford University Press, 1993, pp. 289319.
[26]Sipser, Michael, A complexity theoretic approach to randomness, Proceedings of the ACM Symposium on Theory of Computing, ACM, 1983, pp. 330335.
[27]Thapen, Neil, The weak pigeonhole principle in models of bounded arithmetic, Ph.D. thesis, Oxford University, 2002.
[28]Thapen, Neil, Structures interpretahle in models of bounded arithmetic, Annals of Pure and Applied Logic, vol. 136 (2005), no. 3, pp. 247266.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed