Approximate counting by hashing in bounded arithmetic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F09%3A00326451" target="_blank" >RIV/67985840:_____/09:00326451 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximate counting by hashing in bounded arithmetic
Original language description
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 appications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy tot he collapse of the polynomial-time hierarchy.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Symbolic Logic
ISSN
0022-4812
e-ISSN
—
Volume of the periodical
74
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
32
Pages from-to
—
UT code for WoS article
000269571100006
EID of the result in the Scopus database
—