@inbook{ff9944718c3a45ec921f706449668ebf,
title = "A protocol for serializing unique strategies",
abstract = "We devise an efficient protocol by which a series of twoperson games G i with unique winning strategies can be combined into a single game G with unique winning strategy, even when the result of G is a non-monotone function of the results of the d that is unknown to the players. In computational complexity terms, we show that the class UAP of Niedermeier and Rossmanith [10] of languages accepted by unambiguous polynomial-time alternating TMs is self-low, i.e., UAPUAP = UAP. It follows that UAP contains the Graph Isomorphism problem, nominally improving the problem's classification into SPP by Arvind and Kurur [2] since UAP is a subclass of SPP [10]. We give some other applications, oracle separations, and results on problems related to unique-alternation formulas.",
author = "Marcel Crasmaru and Christian Gla{\ss}er and Regan, \{Kenneth W.\} and Samik Sengupta",
year = "2004",
doi = "10.1007/978-3-540-28629-5\_51",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "660--672",
editor = "Jir{\'i} Fiala and Jan Kratochv{\'i}l and Koubek, \{V{\'a} clav\}",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}