Approximate counting 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_____%2F07%3A00090491" target="_blank" >RIV/67985840:_____/07:00090491 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximate counting in bounded arithmetic
Original language description
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 complexityclasses ( such as BPP, APP, MA, AM) in PV1 + dWPHP(PV).
Czech name
Aproximativní počítání v omezené aritmetice
Czech description
Rozpracujeme v omezené aritmetice aproximaci velikostí množin definovatelných booleovskými obvody pomocí duálního slabého principu PHP. Uvedeme aplikace pro formalizování pravděpodobnostních algoritmů v omezené aritmetice.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
2007
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
72
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
35
Pages from-to
959-993
UT code for WoS article
—
EID of the result in the Scopus database
—