Linear Logic Proof Games and Optimization
From MaRDI portal
complexity of determining winning strategiesinteractive proofslinear logic gamesnon-approximabilityprobabilistic proof gameprobabilistic verifier characterization of PSPACEPSPACE-hardnessrandomized proof checking
Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Applications of game theory (91A80)
Recommendations
Cites work
- A game semantics for linear logic
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Decision problems for propositional linear logic
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- IP = PSPACE
- Linear logic
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(4)
This page was built for publication: Linear Logic Proof Games and Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689264)