Skip to main content
Springer Nature Link
Log in

On the Power of Unambiguity in Alternating Machines

  • Conference paper
Fundamentals of Computation Theory (FCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3623))

Included in the following conference series:

  • 894 Accesses

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aida, S., Crâsmaru, M., Regan, K., Watanabe, O.: Games with uniqueness properties. Theory of Computing Systems 37(1), 29–47 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arvind, V., Kurur, P.: Graph isomorphism is in SPP. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 743–750. IEEE Computer Society, Los Alamitos (2002)

    Chapter  Google Scholar 

  3. Beigel, R.: On the relativized power of additional accepting paths. In: Proceedings of the 4th Structure in Complexity Theory Conference, pp. 216–224. IEEE Computer Society Press, Los Alamitos (1989)

    Chapter  Google Scholar 

  4. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 55(1–3), 80–88 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy II: Applications. SIAM Journal on Computing 18(1), 95–111 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. Journal of the ACM 26(1) (1981)

    Google Scholar 

  7. Crâsmaru, M., Glaßer, C., Regan, K.W., Sengupta, S.: A protocol for serializing unique strategies. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 660–672. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Crescenzi, P., Silvestri, R.: Sperner’s lemma and robust machines. Computational Complexity 7, 163–173 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fortnow, L.: Relativized worlds with an infinite hierarchy. Information Processing Letters 69(6), 309–313 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–335 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hartmanis, J., Hemachandra, L.: Robust machines accept easy sets. Theoretical Computer Science 74(2), 217–225 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Håstad, J.: Computational Limitations of Small-Depth Circuits. MIT Press, Cambridge (1987)

    Google Scholar 

  13. Hemaspaandra, L., Rothe, J.: Unambiguous computation: Boolean hierarchies and sparse Turing-complete sets. SIAM Journal on Computing 26(3), 634–653 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ko, K.: On some natural complete operators. Theoretical Computer Science 37(1), 1–30 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ko, K.: Relativized polynomial time hierarchies having exactly k levels. SIAM Journal on Computing 18(2), 392–408 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ko, K.: Separating the low and high hierarchies by oracles. Information and Computation 90(2), 156–177 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lange, K.-J., Rossmanith, P.: Unambiguous polynomial hierarchies and exponential size. In: Proceedings of the 9th Structure in Complexity Theory Conference, pp. 106–115. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  18. Niedermeier, R., Rossmanith, P.: Unambiguous computations and locally definable acceptance types. Theoretical Computer Science 194(1–2), 137–161 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  19. Ogiwara, M., Hemachandra, L.: A complexity theory for feasible closure properties. Journal of Computer and System Sciences 46(3), 295–325 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  20. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  21. Sheu, M., Long, T.: The extended low hierarchy is an infinite hierarchy. SIAM Journal on Computing 23(3), 488–509 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Sheu, M., Long, T.: UP and the low and high hierarchies: A relativized separation. Mathematical Systems Theory 29(5), 423–449 (1996)

    MATH  MathSciNet  Google Scholar 

  23. Stockmeyer, L.: The polynomial-time hierarchy. Theoretical Computer Science 3, 1–22 (1976)

    Article  MathSciNet  Google Scholar 

  24. Wagner, K.: Alternating machines using partially defined “AND” and “OR”. Technical Report 39,In: Institut für Informatik, Universität Würzburg (January 1992)

    Google Scholar 

  25. Yao, A.: Separating the polynomial-time hierarchy by oracles. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 1–10 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Heinrich-Heine-Universität, 40225, Düsseldorf, Germany

    Holger Spakowski

  2. Dept. of Computer Science and Engineering, University of South Florida, Tampa, Fl, 33620, USA

    Rahul Tripathi

Authors
  1. Holger Spakowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rahul Tripathi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Theoretische Informatik, Universität zu Lübeck, Germany

    Maciej Liśkiewicz

  2. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23538, Lübeck, Germany

    Rüdiger Reischuk

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spakowski, H., Tripathi, R. (2005). On the Power of Unambiguity in Alternating Machines. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_12

Download citation

  • DOI: https://doi.org/10.1007/11537311_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28193-1

  • Online ISBN: 978-3-540-31873-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics