Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Engineering
Reference19 articles.
1. Creignou, N., Hermann, M.: On #P-completeness of some counting problems. Research report 2144, Institut de Recherche en Informatique et en Automatique (1993)
2. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Inform. Comput. 125, 1–12 (1996)
3. Dagum, P., Luby, M.: Approximating the permanent of graphs with large factors. Theor. Comput. Sci. 102, 283–305 (1992)
4. Dahlhaus, E., Karpinski, M.: Perfect matching for regular graphs is $$AC^0$$-hard for the general matching problem. J. Comput. Syst. Sci. 44, 94–102 (1992)
5. De Loera, J., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming. Disc. Optim. 5, 231–241 (2008)