Arthur-Merlin games in boolean decision trees

Ran Raz, G. Tardos, Oleg Verbitsky, Nikolai Vereshchagin

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The structural properties of Arthur-Merlin games are discussed. This is motivated by the question if randomization can speed up a nondeterministic computation via a boolean decision tree. Results include connections with the block sensitivity and related combinatorial properties of a boolean function.

Original languageEnglish
Pages (from-to)346-372
Number of pages27
JournalJournal of Computer and System Sciences
Volume59
Issue number2
DOIs
Publication statusPublished - Oct 1999

Fingerprint

Boolean functions
Decision trees
Randomisation
Boolean Functions
Decision tree
Structural Properties
Structural properties
Speedup
Game

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Arthur-Merlin games in boolean decision trees. / Raz, Ran; Tardos, G.; Verbitsky, Oleg; Vereshchagin, Nikolai.

In: Journal of Computer and System Sciences, Vol. 59, No. 2, 10.1999, p. 346-372.

Research output: Contribution to journalArticle

Raz, Ran ; Tardos, G. ; Verbitsky, Oleg ; Vereshchagin, Nikolai. / Arthur-Merlin games in boolean decision trees. In: Journal of Computer and System Sciences. 1999 ; Vol. 59, No. 2. pp. 346-372.
@article{af4b79e6901742c3b071f99a5b76d9d2,
title = "Arthur-Merlin games in boolean decision trees",
abstract = "The structural properties of Arthur-Merlin games are discussed. This is motivated by the question if randomization can speed up a nondeterministic computation via a boolean decision tree. Results include connections with the block sensitivity and related combinatorial properties of a boolean function.",
author = "Ran Raz and G. Tardos and Oleg Verbitsky and Nikolai Vereshchagin",
year = "1999",
month = "10",
doi = "10.1006/jcss.1999.1654",
language = "English",
volume = "59",
pages = "346--372",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Arthur-Merlin games in boolean decision trees

AU - Raz, Ran

AU - Tardos, G.

AU - Verbitsky, Oleg

AU - Vereshchagin, Nikolai

PY - 1999/10

Y1 - 1999/10

N2 - The structural properties of Arthur-Merlin games are discussed. This is motivated by the question if randomization can speed up a nondeterministic computation via a boolean decision tree. Results include connections with the block sensitivity and related combinatorial properties of a boolean function.

AB - The structural properties of Arthur-Merlin games are discussed. This is motivated by the question if randomization can speed up a nondeterministic computation via a boolean decision tree. Results include connections with the block sensitivity and related combinatorial properties of a boolean function.

UR - http://www.scopus.com/inward/record.url?scp=0032597108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032597108&partnerID=8YFLogxK

U2 - 10.1006/jcss.1999.1654

DO - 10.1006/jcss.1999.1654

M3 - Article

AN - SCOPUS:0032597108

VL - 59

SP - 346

EP - 372

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 2

ER -