Author:
Balc�zar Jos� L.,Book Ronald V.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference20 articles.
1. Allender, E.: The complexity of sparse sets in P. Proc. Conference on Structure in Complexity Theory. Lect. Notes Comput, Sci. (233), pp. 1?11. Heidelberg, Berlin, New York: Springer
2. Balcázar, J., Book, R., Schöning, U.: On bounded query machines. Theor. Comput. Sci. 40, 237?243 (1985)
3. Balcázar, J., Book, R., Schöning, U.: Sparse sets, lowness, and highness, SIAM J. Comput. 15 (1986) (To appear). Also see: Mathematical Foundations of Computer Science. Lect. Notes Comput. Sci. 176, 185?193 (1984)
4. Book, R., Long, T., Selman, A.: Quantitative relativizations of complexity classes. SIAM J. Comput. 13, 461?487 (1984)
5. Chaitin, G.: On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach. 13, 547?569 (1966)
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Small sample datasets build powerful image classification models;International Conference on Cloud Computing, Performance Computing, and Deep Learning (CCPCDL 2022);2022-10-13
2. Extreme Data Mining: Inference from Small Datasets;International Journal of Computers Communications & Control;2010-09-01
3. Open questions in the theory of semifeasible computation;ACM SIGACT News;2006-03
4. All superlinear inverse schemes are coNP-hard;Theoretical Computer Science;2005-11
5. Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets;Lecture Notes in Computer Science;2004