Author:
Hemaspaandra Lane A.,Hempel⋆ Harald,Nickelsen Arfst
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. E. Allender and L. Hemachandra Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234–251, 1992.
2. J. Balcázar and U. Schöning Logarithmic advice classes. Theoretical Computer Science, 99(2):279–290, 1992.
3. J. Hartmanis and Y. Yesha Computation times of NP sets of different densities. Theoretical Computer Science, 34:17–32, 1984.
4. E. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman P-selective sets and reducing search to decision vs. self-reducibility. Journal of Computer and System Sciences, 53(2):194–209, 1996.
5. L. Hemaspaandra, H. Hempel, and A. Nickelsen Algebraic properties for deterministic and nondeterministic selectivity. In Preparation.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献