Pages that link to "Item:Q1117218"
From MaRDI portal
The following pages link to Relativized Arthur-Merlin versus Merlin-Arthur games (Q1117218):
Displaying 7 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
