Shorter arithmetization of nondeterministic computations (Q496013)

From MaRDI portal
Revision as of 19:25, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Shorter arithmetization of nondeterministic computations
scientific article

    Statements

    title
    Shorter arithmetization of nondeterministic computations (English)
    0 references
    author
    Alessandro Chiesa
    0 references
    Zeyuan Allen Zhu
    0 references
    publication date
    16 September 2015
    0 references
    zbMATH Keywords
    arithmetization
    0 references
    probabilistically-checkable proofs
    0 references
    polylogarithmic-time verifier
    0 references
    cites work
    Q4527016
    0 references
    Q5513488
    0 references
    Q4133134
    0 references
    Q4527018
    0 references
    Q3826533
    0 references
    Q4002466
    0 references
    Q5690468
    0 references
    Q5608026
    0 references
    Q4527015
    0 references
    IP = PSPACE
    0 references
    IP = SPACE
    0 references
    A Permutation Network
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q04
    0 references
    68Q09
    0 references
    68Q10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6482886
    0 references
    OpenAlex ID
    W935592923
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q496013&oldid=36201284"
    Powered by MediaWiki