Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (Q2941756)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
scientific article

    Statements

    Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (English)
    0 references
    0 references
    25 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded arithmetic
    0 references
    complexity theory
    0 references
    formalizations
    0 references
    0 references
    0 references