Non-deterministic exponential time has two-prover interactive protocols (Q685724)

From MaRDI portal
Revision as of 15:41, 27 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Non-deterministic exponential time has two-prover interactive protocols
scientific article

    Statements

    Non-deterministic exponential time has two-prover interactive protocols (English)
    0 references
    0 references
    0 references
    10 October 1993
    0 references
    0 references
    interactive proof systems
    0 references
    verification scheme for multilinearity
    0 references
    program verification
    0 references
    0 references