Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Structural Complexity I, II;Balcarzar,1990
2. On sets truth-table reducible to sparse sets;Book;SIAM J. Comput.,1988
3. A note on sparse complete sets;Fortune;SIAM J. Comput.,1979
4. B. Fu, On lower bounds of the closeness between complexity classes, Math. Systems Theory, to appear.
5. On closeness of NP-hard sets to other complexity classes;Fu,1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A note on P-selective sets and closeness;Information Processing Letters;1995-05
2. Semi-membership algorithms;ACM SIGACT News;1994-09