On lower bounds of the closeness between complexity classes-Reference-Cited by-同舟云学术

On lower bounds of the closeness between complexity classes

Published:1993-06 Issue:2 Volume:26 Page:187-202
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Fu Bin

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/BF01202282.pdf

Reference11 articles.

1. J. Balcazar, J. Diaz, and J. Gabarro,Structural Complexity, I, II, Springer-Verlag, New York, 1988, 1990.

2. R. Book and K. Ko, On sets truth-table reducible to sparse sets,SIAM J. Comput.,17 (1988), 903?919.

3. B. Fu, On Closeness of NP-hard Sets to co-NP. Preprint, May, 1991.

4. Lecture Notes in Computer Science;K. Ganesan,1989

5. K. Ko, Distinguishing bounded reducibility by sparse sets,Proc. 3rd Conf. on Structural Complexity Theory, 1988, pp. 181?191.

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

1. The fault tolerance of NP-hard problems;Information and Computation;2011-03

2. Separating NE from some nonuniform nondeterministic complexity classes;Journal of Combinatorial Optimization;2010-04-22

3. The Fault Tolerance of NP-Hard Problems;Language and Automata Theory and Applications;2009

4. Separating NE from Some Nonuniform Nondeterministic Complexity Classes;Lecture Notes in Computer Science;2009

5. Properties of NP‐Complete Sets;SIAM Journal on Computing;2006-01