Linear Logic Proof Games and Optimization (Q5689264): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146375788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game semantics for linear logic / 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: IP = PSPACE / 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: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for propositional linear logic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:01, 27 May 2024

scientific article; zbMATH DE number 961058
Language Label Description Also known as
English
Linear Logic Proof Games and Optimization
scientific article; zbMATH DE number 961058

    Statements

    Linear Logic Proof Games and Optimization (English)
    0 references
    0 references
    0 references
    0 references
    25 May 1997
    0 references
    interactive proofs
    0 references
    randomized proof checking
    0 references
    probabilistic verifier characterization of PSPACE
    0 references
    probabilistic proof game
    0 references
    complexity of determining winning strategies
    0 references
    non-approximability
    0 references
    PSPACE-hardness
    0 references
    linear logic games
    0 references

    Identifiers

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