On the power of unambiguity in alternating machines

Authors:
Holger Spakowski;Rahul Tripathi
Affiliations:
Institut für Informatik, Heinrich-Heine-Universität, Düsseldorf, Germany;Dept. of Computer Science and Engineering, University of South Florida, Tampa, Fl
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 14
Cited 2

Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
Complexity measures for public-key cryptosystems

SIAM Journal on Computing - Special issue on cryptography
The Boolean hierarchy II: applications

SIAM Journal on Computing
Relativized polynomial time hierarchies having exactly K levels

SIAM Journal on Computing
Robust machines accept easy sets

Theoretical Computer Science
Separating the low and high hierarchies by oracles

Information and Computation
The Extended Low Hierarchy Is an Infinite Hierarchy

SIAM Journal on Computing
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

SIAM Journal on Computing
Unambiguous computations and locally definable acceptance types

Theoretical Computer Science
Sperner's lemma and robust machines

Computational Complexity
Relativized worlds with an infinite hierarchy

Information Processing Letters
Alternation

Journal of the ACM (JACM)
Graph Isomorphism is in SPP

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Separating the polynomial-time hierarchy by oracles

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science

Languages polylog-time reducible to dot-depth 1/2

Journal of Computer and System Sciences
Machines that can output empty words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, the property of unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [1] and in the design of efficient protocols involving globally-unique games by Crâsmaru et al. [7].