Skip to main content

Approximate counting by hashing in bounded arithmetic

  • Emil Jeřábek (a1)

We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.

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? *



Full text views

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

Abstract views

Total abstract views: 52 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 19th November 2017. This data will be updated every 24 hours.