Author:
Fellows Michael R.,Koblitz Neal
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference12 articles.
1. M.J. Beeson, Foundations of Constructive Mathematics, Springer, Berlin (1985).
2. N.G. de Bruijn, On the number of positive integers ? x and free of prime factors ? y, Indag. Math. Vol. 28 (1966) pp. 239?247.
3. M.R. Fellows and M.A. Langston, On search, decision and the efficiency of polynomial-time algorithms, Proceedings of the ACM Symposium on Theory of Computing (1989) pp. 501?512.
4. J. Feigenbaum, R.J. Lipton and S.R. Mahaney, A completeness theorem for almost everywhere invulnerable generators, Technical Memorandum, AT&T Bell Laboratories, (February 1989).
5. D.S. Johnson, The NP-completeness column: an ongoing guide, Column 19, J. Algorithms vol. 8 (1987) pp. 285?303.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献