Author:
Murawski Carsten,Bossaerts Peter
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Mathews, G. B. On the partition of numbers. Proceedings of the London Mathematical Society 28, 486–490 (1897).
2. Kellerer, H., Pferschy, U. & Pisinger, D. Knapsack Problems (Springer Science & Business Media, 2004).
3. Cook, S. A. An overview of computational complexity. Communications of the ACM 26, 400–408 (1983).
4. Karp, R. M. Reducibility among Combinatorial Problems. In Complexity of Computer Computations 85–103 (Springer: US,, 1972).
5. Moore, C. & Mertens, S. The Nature of Computation (Oxford University Press, Oxford, 2011).
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献