✦ LIBER ✦

Quantum Arthur–Merlin games

✍ Scribed by Chris Marriott; John Watrous

Publisher: Springer
Year: 2005
Tongue: English
Weight: 267 KB
Volume: 14
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-005-0194-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arthur–Merlin Games in Boolean Decision

Arthur–Merlin Games in Boolean Decision Trees

✍ Ran Raz; Gábor Tardos; Oleg Verbitsky; Nikolai Vereshchagin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones (N. Nisan, SIAM J. Comput. 20, No. 6 (1991), 999 1007). Motivated by a question if randomization can significantly speed up a nondeterministic computation via a boolean decision tree, we a

Derandomizing Arthur—Merlin games under

Derandomizing Arthur—Merlin games under uniform assumptions

✍ C.-J. Lu 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 296 KB

Derandomizing Arthur–Merlin Games using

Derandomizing Arthur–Merlin Games using Hitting Sets

✍ Peter Bro Miltersen; N. V. Vinodchandran 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 266 KB

Uniform hardness versus randomness trade

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

✍ Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 441 KB

Derandomizing Arthur-Merlin Games and Ap

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

✍ Barış Aydınlıog̃lu; Dan Gutfreund; John M. Hitchcock; Akinori Kawachi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 412 KB

On small space complexity classes of sto

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games

✍ M. Liskiewicz; R. Reischuk 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 329 KB