Arthur-Merlin games in Boolean decision trees
type: Item
instance of: scholarly article
title: Arthur-Merlin games in Boolean decision trees
zbMATH Open document ID: 0948.68166
author: Ran Raz
author: Gábor Tardos
author: Oleg Verbitsky
author: Nikolai K. Vereshchagin
published in: Journal of Computer and System Sciences
publication date: 2000-11-22T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1389790
zbMATH Keywords: Merlin-Arthur protocol
MaRDI profile type: Publication
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Robust machines accept easy sets
cites work: Neither reading few bits twice nor reading illegally helps much
cites work: Q3996586
cites work: A general method to construct oracles realizing given relationships between complexity classes
cites work: CREW PRAM<scp>s</scp> and Decision Trees
cites work: Selbstduale Goppa-Codes
cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
description: scientific article; zbMATH DE number 1389790