Author:
Buss Jonathan F.,Goldsmith Judy
Reference16 articles.
1. K. R. Abrahamson, J. A. Ellis, M. R. Fellows and M. E. Mata, “On the Complexity of Fixed Parameter Problems,” in 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1989, pp. 210–215.
2. K. R. Abrahamson, J. A. Ellis, M. R. Fellows and M. E. Mata, “Completeness for Families of Fixed Parameter Problems,” manuscript, 1990.
3. C. Àlvarez, J. Díaz and J. Torán, “Complexity Classes With Complete Problems Between P and NP-Complete,” in Foundations of Computation Theory, Lecture Notes in Computer Science 380, Springer-Verlag, 1989.
4. J. F. Buss and J. Goldsmith, “Nondeterminism Within P,” submitted to SIAM J. Computing, 1990.
5. S. R. Buss, personal communication.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献