Arthur-Merlin games in Boolean decision trees
From MaRDI portal
Recommendations
Cites work
- A general method to construct oracles realizing given relationships between complexity classes
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- CREW PRAM<scp>s</scp> and Decision Trees
- scientific article; zbMATH DE number 46318 (Why is no real title available?)
- Neither reading few bits twice nor reading illegally helps much
- Query complexity, or why is it difficult to separate NP^ A coNP^ A from P^ A by random oracles A?
- Robust machines accept easy sets
- Selbstduale Goppa-Codes
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(9)- Derandomizing Arthur-Merlin games under uniform assumptions
- Quantum certificate complexity
- Lower Bounds for Swapping Arthur and Merlin
- scientific article; zbMATH DE number 4050983 (Why is no real title available?)
- scientific article; zbMATH DE number 1335880 (Why is no real title available?)
- scientific article; zbMATH DE number 2080255 (Why is no real title available?)
- The layer complexity of Arthur-Merlin-like communication
- New Computational Paradigms
- Derandomizing Arthur-Merlin games using hitting sets
This page was built for publication: Arthur-Merlin games in Boolean decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961380)
