Author:
Gasarch William I.,Hemachandra Lane A.,Hoene Albrecht
Reference44 articles.
1. A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77:37–56, 1988.
2. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. In Automata, Languages, and Programming (ICALP 1989), pages 31–45. Springer-Verlag Lecture Notes in Computer Science #372, July 1989.
3. E. Allender. The complexity of sparse sets in P. In Proceedings 1st Structure in Complexity Theory Conference, pages 1–11, Springer-Verlag Lecture Notes in Computer Science #223, June 1986.
4. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193–1202, 1988.
5. Y. Barzdin'. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Soviet Math. Dokl., 9:1251–1254, 1968.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献