Publisher
Springer International Publishing
Reference20 articles.
1. Beyersdorff, O., Meier, A., Thomas, M., Vollmer, H.: The complexity of propositional implication. Inf. Process. Lett. 109(18), 1071–1077 (2009)
2. Böhler, E., Creignou, N., Galota, M., Reith, S., Schnoor, H., Vollmer, H.: Complexity classifications for different equivalence and audit problems for Boolean circuits. Logical Methods Comput. Sci. 8(3) (2012). https://lmcs.episciences.org/1172
3. Bulatov, A.A., Dyer, M.E., Goldberg, L.A., Jalsenius, M., Jerrum, M., Richerby, D.: The complexity of weighted and unweighted #csp. J. Comput. Syst. Sci. 78(2), 681–688 (2012)
4. Creignou, N., Hébrard, J.-J.: On generating all solutions of generalized satisfiability problems. ITA 31(6), 499–511 (1997)
5. Lecture Notes in Computer Science;N Creignou,2011