Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits

The author examines various counting measures on space bounded nondeterministic auxiliary pushdown machines. In the main theorem, it is shown how a NAuxPDA may be simulated efficiently by a uniform family of Boolean circuits, which preserve the number of accepting paths in the NAuxPDA as the number of accepting subtrees in the Boolean circuit. The techniques used simulate the NAuxPDA in a novel way by considering the height and reversal bounds of an AuxPDA. One of the highlights of the present work is an exact characterization of the important class DET. It is shown that DET is exactly the class of functions that can be computed as the difference between the outputs of two counting logspace machines.<<ETX>>

[1]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[2]  Richard E. Ladner.  Polynomial Space Counting Problems , 1989, SIAM J. Comput..

[3]  Birgit Jenner,et al.  Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata , 1988, STACS.

[4]  Neil Immerman,et al.  The complexity of iterated multiplication , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[5]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

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

[7]  Birgit Jenner,et al.  Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata , 1989, RAIRO Theor. Informatics Appl..

[8]  L. Fortnow,et al.  A Characterization of #P by Straight Line Programs of Polynomials, with Applications to Interactive Proofs and Toda''s Theorem , 1990 .

[9]  Carsten Damm,et al.  Problems Complete for \oplus L , 1990, Inf. Process. Lett..

[10]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[11]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[12]  Dung T. Huynh,et al.  The complexity of ranking , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[13]  Jacobo Torán.  Counting the Number of Solutions , 1990, MFCS.

[14]  V. Vinay,et al.  Circuits, pebbling and expressibility , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[15]  V. Vinay,et al.  The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata , 1990, FSTTCS.

[16]  H. Venkateswaran,et al.  Properties that characterize LOGCFL , 1987, J. Comput. Syst. Sci..

[17]  H. Venkateswaran.  Circuit Definitions of Nondeterministic Complexity Classes , 1992, SIAM J. Comput..

[18]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[19]  Leslie G. Valiant,et al.  Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..

[20]  Andrew Chi-Chih Yao,et al.  A Circuit-Based Proof of Toda's Theorem , 1993, Inf. Comput..

[21]  Lane A. Hemaspaandra,et al.  On the Complexity of Ranking , 1990, J. Comput. Syst. Sci..

[22]  Jacobo Torán,et al.  On Counting and Approximation , 1988, CAAP.

[23]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[24]  Carme Àlvarez,et al.  A very hard log space counting class , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.