Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. Cheatable, p-terse, and p-superterse sets;Amir,1988
2. Polynomial terse sets;Amir;Inform. and Comput.,1988
3. Bi-immune sets for complexity classes;Balcazar;Math. Systems Theory,1985
4. R. Beigel, Bounded queries to SAT and the boolean hierarchy, Theoret. Comput. Sci., to appear.
5. NP-hard sets are p-superterse unless R = NP;Beigel,1988
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Infinitely‐Often Autoreducible Sets;SIAM Journal on Computing;2006-01
2. Partial information classes;ACM SIGACT News;2003-03
3. Infinitely-Often Autoreducible Sets;Algorithms and Computation;2003
4. Partial Information and Special Case Algorithms;Mathematical Foundations of Computer Science 2001;2001
5. Strong self-reducibility precludes strong immunity;Mathematical Systems Theory;1996-10