Succinct NP Proofs from an Extractability Assumption (Q3507432): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2754165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / 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: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Arguments and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035738 / 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: Q4249347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Feasibility of Consistent Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for collision-free hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PCP characterization of NP with optimal amortized query complexity / rank
 
Normal rank

Latest revision as of 11:23, 28 June 2024

scientific article
Language Label Description Also known as
English
Succinct NP Proofs from an Extractability Assumption
scientific article

    Statements

    Identifiers