Probabilistic proof systems — A survey (Q5048957): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/BFb0023492 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Decision Versus Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0023492 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:44, 30 December 2024

scientific article; zbMATH DE number 7614500
Language Label Description Also known as
English
Probabilistic proof systems — A survey
scientific article; zbMATH DE number 7614500

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references