The Power of Counting-Reference-Cited by-同舟云学术

The Power of Counting

Published:1990 Issue: Volume: Page:204-223
ISSN:
Container-title:Complexity Theory Retrospective
language:
Short-container-title:

Author:

Schöning Uwe

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-4478-3_9.pdf

Reference60 articles.

1. E. Allender. Invertible Functions. Ph.D. thesis, Georgia Tech., 1985.

2. D. Angluin. On counting problems and the polynomial-time hierarchy. Theor. Comput. Sci. 12 (1980): 161–173.

3. T.P. Baker, J. Gill, and R.M. Solovay. Relativizations of the P=?NP question. SIAM J. Comput. 4 (1975): 431–442.

4. J.L. Balcázar, R.V. Book, and U. Schöning. The polynomial-time hierarchy and sparse oracles. Joun. of the Assoc. Comput. Mach. 33 (1986): 603–617.

5. Y.M. Barzdin. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Soviet Math. Dokl. 9 (1968): 1251–1254.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computational Complexity of Counting Coincidences;2023

2. Exact Computation of the Number of Accepting Paths of an NTM;Algorithms and Discrete Applied Mathematics;2018

3. On Toda’s Theorem in Structural Communication Complexity;Lecture Notes in Computer Science;2009

4. Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy;Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences;1999-11-08

5. The Second LBA Problem;Gems of Theoretical Computer Science;1998