Author:
Book R.,Orponen P.,Russo D.,Watanabe O.
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polylog depth, highness and lowness for E;Information and Computation;2020-04
2. High Sets for NP;Advances in Algorithms, Languages, and Complexity;1997
3. Resource-Bounded Complexity;An Introduction to Kolmogorov Complexity and Its Applications;1997
4. With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets;SIAM Journal on Computing;1995-10
5. On Sets with Small Information Content;Kolmogorov Complexity and Computational Complexity;1992