On the Power of Unambiguity in Alternating Machines

Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of efficient protocols involving globally-unique games by Crˆasmaru et al. [CGRS04]. This paper explores the power of unambiguity in alternating Turing machines in the following settings:

• Type: Conference
• Year: 2005
• Where: FCT
• Authors: Holger Spakowski, Rahul Tripathi
• Keywords: Aida Et, FCT 2005, Globally-unique Games, Turing Machines