Author:
Goldsmith Judy,Kunen Kenneth,Hemachandra Lane A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference34 articles.
1. A. Aho and D. Lee,Storing a dynamic sparse table, in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1988, pp. 55?60.
2. E. Allender andR. Rubinstein,P-printable sets, SIAM Journal on Computing, 17 (1988), pp. 1193?1202.
3. C. Bennett andJ. Gill,Relative to a random oracle A, P A ?NP A ? coNP A with probability 1, SIAM Journal on Computing, 10 (1981), pp. 96?113.
4. L. Berman andJ. Hartmanis,On isomorphisms and density of NP and other complete sets, SIAM Journal on Computing, 6 (1977), pp. 305?322.
5. R. Book,Bounded query machines: On NP and PSPACE, Theoretical Computer Science, 15 (1981), pp. 27?39.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献