On log-time alternating Turing machines of alternation depth k
- 120 Downloads
Several input read-modes for alternating Turing machines have been proposed in the literature. For each input read-mode and for each fixed integer k ≥ 1, a precise circuit characterization is established for log-time alternating Turing machines of k alternations, which is a nontrivial refinement of Ruzzo's circuit characterization of alternating Turing machines. Complete languages in strong sense for each level of the log-time hierarchy are presented, refining a result by Buss. The class GC(s(n), Π k B ) is investigated, which is the class of languages accepted by log-time alternating Turing machines of k alternations enhanced by an extra ability of guessing a string of length s(n). A systematic technique is developed to show that for many functions s(n) and for every integer k>1, the class GC(s(n), Π k B ) has natural complete languages. Connections of these results to computational optimization problems are exhibited.
KeywordsTuring Machine Vertex Cover Computation Path Output Gate Proper Subclass
Unable to display preview. Download preview PDF.
- 1.Aggarwal, A., Chandra, A. K., and Snir, M.: Hierarchical memory with block transfer. Proc. 28th Annual IEEE Symposium on Foundations of Computer Science (1987) 204–216Google Scholar
- 2.Boppana, R. B. and Sipser, M.: The complexity of finite functions, in Handbook of Theoretical Computer Science Vol. A, J. van Leeuwen, ed. (1990) 757–804Google Scholar
- 4.Buss, S. R.: The Boolean formula value problem is in ALOGTIME. Proc. 19th Annual ACM Symposium on Theory of Computing (1987) 123–131Google Scholar
- 6.Cai, L. and Chen, J.: On input read-modes of alternating Turing machines. Theoretical Computer Science (1995) to appearGoogle Scholar
- 7.Cai, L. and Chen, J.: On the amount of nondeterminism and the power of verifying. Lecture Notes in Computer Science 711 (MFCS'93) (1993) 311–320Google Scholar
- 8.Cai, L. and Chen, J.: Fixed parameter tractability and approximability of NP-hard optimization problems. Proc. 2rd Israel Symposium on Theory of Computing and Systems (1993) 118–126Google Scholar
- 9.Cai, L., Chen, J., Downey, R., and Fellows, M: On the structure of parameterized problems in NP. Lecture Notes in Computer Science 775 (STACS'94) (1994) 509–520. Journal version to appear in Information and Computation Google Scholar
- 10.Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J.: Alternation. J. Assoc. Comput. Mach. 28 (1981) 114–133Google Scholar
- 14.Downey, R. G. and Fellows, M. R.: Fixed-parameter intractability. Proc. 7th Structure in Complexity Theory Conference (1992) 36–49Google Scholar
- 17.Papadimitriou, C. H. and Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. Proc. 8th Structure in Complexity Theory Conference (1993) 12–18Google Scholar
- 19.Sipser, M.: Borel sets and circuit complexity. Proc. 15th Annual ACM Symposium on Theory of Computing (1983) 61–69Google Scholar