Author:
Bauland Michael,Chapdelaine Philippe,Creignou Nadia,Hermann Miki,Vollmer Heribert
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Abiteboul, S., Hull, R., Vianu, V.: Foundation of databases. Addison-Wesley, Reading (1995)
2. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT News, Complexity Theory Column 42, 34(4), 38–52 (2003)
3. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part II: Constraint satisfaction problems. SIGACT News, Complexity Theory Column 43, 35(1), 22–35 (2004)
4. Creignou, N., Hermann, M.: On #P-completeness of some counting problems. Research report 2144, Institut de Recherche en Informatique et en Automatique (December 1993),
http://www.lix.polytechnique.fr/~hermann/publications/satcount.ps.gz
5. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation 125(1), 1–12 (1996)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献