Interactive and probabilistic proof-checking (Q1577488): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Statistical zero-knowledge languages can be recognized in two rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527016 / 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: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle hypothesis is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two prover protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of multi-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are there interactive protocols for co-NP languages? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern cryptography, probabilistic proofs and pseudo-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542514 / 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: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542548 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0168-0072(00)00017-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996183456 / rank
 
Normal rank

Latest revision as of 09:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Interactive and probabilistic proof-checking
scientific article

    Statements

    Interactive and probabilistic proof-checking (English)
    0 references
    4 September 2000
    0 references
    efficient proof-checking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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