Advertisement

Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)

  • Viliam Geffert
Article
Part of the following topical collections:
  1. Computer Science Symposium in Russia

Abstract

We study the class of binary coded versions of unary languages that can be accepted by alternating machines with loglog n space. We show that there exists a binary PSpace-complete language \(\mathcal {L}\) such that the unary coded version of \(\mathcal {L}\) is in ASpace(loglog n). Consequently, the standard translation between unary languages accepted with loglog n space and binary languages accepted with log n space works for alternating machines if and only ifP = PSpace. In general, if a binary language is accepted deterministically in 2 n nO(1) time and, simultaneously, in nO(1) space—which covers many PSpace-complete problems—then its unary coded version is accepted by an alternating Turing machine using an initially delimited worktape of size loglog n. This unexpected power follows from the fact that, with an auxiliary worktape of size O(loglog n) on a unary input 1 n , an alternating machine can simulate a stack with log n bits, representing the contents of the stack by its input head position. The standard push/pop operations on the stack are implemented by moving the head along the input.

Keywords

Computational complexity Alternation Sublogarithmic space 

Notes

Acknowledgements

The author would like to thank the reviewers and the Program Committee of CSR 2017 for their suggestions, especially for sending a summary of PC discussions which gave inspiration for several improvements, and the anonymous reviewer of ToCS for helping to simplify the proof of Lemma 4.

References

  1. 1.
    Allender, E.: The division breakthroughs. Bull. Eur. Assoc. Theoret. Comput. Sci. 74, 61–77 (2001)MathSciNetMATHGoogle Scholar
  2. 2.
    Allender, E., Mix Barrington, D., Hesse, W.: Uniform circuits for division: consequences and problems. In: Proc. IEEE Conf. Comput. Complexity, pp. 150–59 (2001)Google Scholar
  3. 3.
    Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)Google Scholar
  4. 4.
    Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. Assoc. Comput. Mach. 28, 114–33 (1981)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chang, R., Hartmanis, J., Ranjan, D.: Space bounded computations: review and new separation results. Theoret. Comput. Sci. 80, 289–302 (1991)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Chiu, A.: Complexity of parallel arithmetic using the Chinese Remainder Representation. Master’s thesis, Univ. Wisconsin-Milwaukee (G. Davida, supervisor) (1995)Google Scholar
  7. 7.
    Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform N C 1. RAIRO Inform. Théor. Appl. 35, 259–75 (2001)CrossRefMATHGoogle Scholar
  8. 8.
    Davida, G., Litow, B.: Fast parallel arithmetic via modular representation. SIAM J. Comput. 20, 756–65 (1991)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Dietz, P., Macarie, I., Seiferas, J.: Bits and relative order from residues, space efficiently. Inform. Process. Lett. 50, 123–27 (1994)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Dussart, P.: The k th prime is greater than k ⋅ (ln k + ln ln − 1) for k ≥ 2. Math. Comp. 68, 411–15 (1999)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Emde Boas, P.: Machine models and simulations. In: Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Elsevier Science (1989)Google Scholar
  12. 12.
    Geffert, V.: Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Comput. 20, 484–98 (1991)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Geffert, V.: Bridging across the log(n) space frontier. Inf. Comput. 142, 127–58 (1998)CrossRefMATHGoogle Scholar
  14. 14.
    Geffert, V.: Alternating space is closed under complement and other simulations for sublogarithmic space. Inf. Comput. 253, 163–78 (2017)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Geffert, V., Pardubská, D.: Unary coded NP-complete languages in ASPACE(log log n). Int. J. Found. Comput. Sci. 24, 1167–82 (2013)CrossRefMATHGoogle Scholar
  16. 16.
    Hartmanis, J., Immerman, N., Sewelson, W.: Sparse sets in NP–P: EXPTIME versus NEXPTIME. Inf. Control. 65, 158–81 (1985)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Hartmanis, J., Lewis, P. II, Stearns, R.: Hierarchies of memory limited computations. In: IEEE Conf. Record on Switching Circuit Theory and Logical Design, pp. 179–90 (1965)Google Scholar
  18. 18.
    Hartmanis, J., Stearns, R.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285–306 (1965)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)MATHGoogle Scholar
  20. 20.
    Koblitz, N.: A Course in Number Theory and Cryptography, Graduate Texts in Mathematics, vol. 114. Springer, Berlin (1994)CrossRefGoogle Scholar
  21. 21.
    Ladner, R., Lipton, R., Stockmeyer, L.: Alternating pushdown and stack automata. SIAM J. Comput. 13, 135–55 (1984)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Liśkiewicz, M., Reischuk, R.: The sublogarithmic alternating space world. SIAM J. Comput. 25, 828–61 (1996)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Macarie, I.: Space-efficient deterministic simulation of probabilistic automata. In: Proc. Symp. Theoret. Aspects Comput. Sci., Lect. Notes Comput. Sci., vol. 775, pp 109–22. Springer (1994)Google Scholar
  24. 24.
    Meyer, A., Stockmeyer, L.: Word problems requiring exponential time. In: Proc. ACM Symp. Theory of Comput., pp 1–9 (1973)Google Scholar
  25. 25.
    Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4, 177–92 (1970)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Stockmeyer, L.: The polynomial time hierarchy. Theoret. Comput. Sci. 3, 1–22 (1977)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Sudborough, I.: Efficient algorithms for path system problems and applications to alternating and time-space complexity classes. In: Proc. IEEE Symp. Found. of Comput. Sci., pp 62–73 (1980)Google Scholar
  28. 28.
    Szepietowski, A.: Turing Machines with Sublogarithmic Space, Lect. Notes Comput. Sci., vol. 843. Springer, Berlin (1994)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceP. J. Šafárik UniversityKošiceSlovakia

Personalised recommendations