Randomized proofs in arithmetic (Q1807460): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetization: A new method in structural complexity theory / 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: Alternation / 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: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the computational complexity of problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:21, 29 May 2024

scientific article
Language Label Description Also known as
English
Randomized proofs in arithmetic
scientific article

    Statements

    Randomized proofs in arithmetic (English)
    0 references
    0 references
    22 November 1999
    0 references
    randomized proof system
    0 references
    random substitution rule
    0 references
    interactive proof
    0 references
    Arthur-Merlin proofs
    0 references

    Identifiers

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