Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference8 articles.
1. Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discrete Appl. Math. 154, 1344–1357 (2006)
2. Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Discrete Appl. Math. 156, 2035–2049 (2008)
3. The Integer Sequences Webpage. http://oeis.org/A005493
4. Odlyzko, A.: Asymptotic enumeration methods. In: Handbook of Combinatorics, vol. 2, pp. 1063–1229. Elsevier, Amsterdam (1995)
5. Wild, M.: Compactly generating all satisfying truth assignments of a Horn formula. J. Satisf. Boolean Model. Comput. 8, 63–82 (2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献