On the Complexity of Counting in the Polynomial Hierarchy

Abstract

Piotrow, M., On the complexity of counting in the polynomial hierarchy, Theoretical Computer Science 81 (1991) 77-95. We investigate the time complexity of the following counting problem: for a given set of words A, a length n and a number k, check whether A contains exactly k words of length n (in symbol, if cr,( n) = k). Oracle alternating Turing machines… (More)
DOI: 10.1016/0304-3975(91)90317-U

Topics

Cite this paper

@article{Piotrw1991OnTC, title={On the Complexity of Counting in the Polynomial Hierarchy}, author={Marek Piotr{\'o}w}, journal={Theor. Comput. Sci.}, year={1991}, volume={81}, pages={77-95} }