Publisher
Springer International Publishing
Reference8 articles.
1. Lecture Notes in Computer Science;H Buhrman,2009
2. Lecture Notes in Computer Science;L Fortnow,2011
3. Fortnow, L., Santhanam, R.: Hierarchies against sublinear advice. Technical report TR14-171, Electronic Colloquium on Computational Complexity (2014)
4. Cook, S.: A hierarchy for nondeterministic time complexity. J. Comput. Syst. Sci. 7(4), 343–353 (1973)
5. Seiferas, J., Fischer, M., Meyer, A.: Separating nondeterministic time complexity classes. J. ACM 25(1), 146–167 (1978)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献