A relationship between difference hierarchies and relativized polynomial hierarchies-Reference-Cited by-同舟云学术

A relationship between difference hierarchies and relativized polynomial hierarchies

Published:1993-09 Issue:3 Volume:26 Page:293-310
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Beigel Richard,Chang Richard,Ogiwara Mitsunori

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01371729.pdf

Reference27 articles.

1. E. Allender and L. A. Hemachandra. Lower bounds for the low hierarchy. Inproceedings of the 16th ICALP, pages 31?45. Lecture Notes in Computer Science, Volume 372. Springer-Verlag, Berlin, 1989.

2. A. Amir, R. Beigel, and W. I. Gasarch. Some connections between bounded query classes and non-uniform complexity. InProceedings of the 5th Annual Conference on Structure in Complexity Theory, pages 232?243. IEEE Computer Society Press, New York, July 1990.

3. A. Amir and W. I. Gasarch. Polynomial terse sets.Inform. and Comput. 77:37?56, April 1988.

4. J. L. Balcázar, R. V. Book, and U. Schöning. Sparse sets, lowness and highness.SIAM J. Comput.,15(3):739?747, August 1986.

5. R. Beigel. Bounded queries to SAT and the Boolean hierarchy.Theoret. Comput. Sci.,84(2): 199?223, July 1991.

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

1. When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems;SIAM Journal on Computing;2022-03-09

2. The Two Queries Assumption and Arthur-Merlin Classes;Mathematical Foundations of Computer Science 2014;2014

3. The 1-Versus-2 Queries Problem Revisited;Theory of Computing Systems;2008-07-23

4. Amplifying ZPP^SAT[1] and the Two Queries Problem;2008 23rd Annual IEEE Conference on Computational Complexity;2008-06

5. Proving SAT does not have small circuits with an application to the two queries problem;Journal of Computer and System Sciences;2008-05