On Input Read-Modes of Alternating Turing Machines

Abstract A number of input read-modes of Turing machines have appeared in the literature. To investigate the differences among these input read-modes, we study log-time alternating Turing machines of constant alternations. For each fixed integer k ⩾ 1 and for each read-mode, 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. These circuit characterizations indicate clearly the differences among the input read-modes. Complete languages in strong sense for each level of the log-time hierarchy are presented, refining a result by Buss. An application of these results to computational optimization problems is described.

[1]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[2]  Desh Ranjan,et al.  Quantifiers and Approximation , 1993, Theor. Comput. Sci..

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[5]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[6]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[7]  Liming Cai,et al.  On fixed-parameter tractability and approximability of NP-hard optimization problems , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[8]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[9]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[10]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[11]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying , 1997, SIAM J. Comput..

[12]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[13]  Jianer Chen.  Characterizing Parallel Hierarchies by Reducibilities , 1991, Inf. Process. Lett..

[14]  Phokion G. Kolaitis,et al.  Logical Definability of NP Optimization Problems , 1994, Inf. Comput..

[15]  Alok Aggarwal,et al.  Hierarchical memory with block transfer , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  P. Clote,et al.  Arithmetic, proof theory, and computational complexity , 1993 .

[17]  Samuel R. Buss,et al.  An Optimal Parallel Algorithm for Formula Evaluation , 1992, SIAM J. Comput..

[18]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[19]  Liming Cai,et al.  On the Structure of Parameterized Problems in NP , 1995, Inf. Comput..

[20]  Michael Sipser,et al.  Borel sets and circuit complexity , 1983, STOC.

[21]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..