LOGICAL STRENGTH OF COMPLEXITY THEORY AND A FORMALIZATION OF THE PCP THEOREM IN BOUNDED ARITHMETIC
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317967" target="_blank" >RIV/00216208:11320/15:10317967 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
LOGICAL STRENGTH OF COMPLEXITY THEORY AND A FORMALIZATION OF THE PCP THEOREM IN BOUNDED ARITHMETIC
Original language description
We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known). This includes a formalization of the existence and of some properties of the (n, d, lambda)-graphs in PV1.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Logical Methods in Computer Science
ISSN
1860-5974
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
2
Country of publishing house
DE - GERMANY
Number of pages
6
Pages from-to
—
UT code for WoS article
000359470700005
EID of the result in the Scopus database
2-s2.0-84938322119