{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:32:24Z","timestamp":1742974344465,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_10","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"109-123","source":"Crossref","is-referenced-by-count":7,"title":["Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Henning","family":"Schnoor","sequence":"additional","affiliation":[]},{"given":"Ilka","family":"Schnoor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11549345_8","volume-title":"Mathematical Foundations of Computer Science 2005","author":"E. Allender","year":"2005","unstructured":"Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The complexity of satisfiability problems: Refining Schaefer\u2019s theorem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 71\u201382. Springer, Heidelberg (2005)"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/954092.954101","volume":"34","author":"E. B\u00f6hler","year":"2003","unstructured":"B\u00f6hler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post\u2019s lattice with applications to complexity theory. ACM-SIGACT Newsletter\u00a034(4), 38\u201352 (2003)","journal-title":"ACM-SIGACT Newsletter"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11549345_12","volume-title":"Mathematical Foundations of Computer Science 2005","author":"M. Bauland","year":"2005","unstructured":"Bauland, M., Hemaspaandra, E.: Isomorphic implication. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 119\u2013130. Springer, Heidelberg (2005); Theory of Computing Systems (to appear)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ipl.2007.08.024","volume":"105","author":"M. Bl\u00e4ser","year":"2008","unstructured":"Bl\u00e4ser, M., Heynen, T., Manthey, B.: Adding cardinality constraints to integer programs with applications to maximum satisfiability. Information Processing Letters\u00a0105, 194\u2013198 (2008)","journal-title":"Information Processing Letters"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-45793-3_28","volume-title":"Computer Science Logic","author":"E. B\u00f6hler","year":"2002","unstructured":"B\u00f6hler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: Equivalence and isomorphism for Boolean constraint satisfaction. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 412\u2013426. Springer, Heidelberg (2002)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-24749-4_15","volume-title":"STACS 2004","author":"E. B\u00f6hler","year":"2004","unstructured":"B\u00f6hler, E., Hemaspaandra, E., Reith, S., Vollmer, H.: The complexity of Boolean constraint isomorphism. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 164\u2013175. Springer, Heidelberg (2004)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/11602613_63","volume-title":"Algorithms and Computation","author":"C. Bazgan","year":"2005","unstructured":"Bazgan, C., Karpinski, M.: On the complexity of global constraint satisfaction. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 624\u2013633. Springer, Heidelberg (2005)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01070906","volume":"5","author":"V.G. Bodnarchuk","year":"1969","unstructured":"Bodnarchuk, V.G., Kalu\u017enin, L.A., Kotov, V.N., Romov, B.A.: Galois theory for Post algebras I, II. Cybernetics\u00a05, 243\u2013252, 531\u2013539 (1969)","journal-title":"Cybernetics"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2005.06.003","volume":"96","author":"E. B\u00f6hler","year":"2005","unstructured":"B\u00f6hler, E., Reith, S., Schnoor, H., Vollmer, H.: Bases for Boolean co-clones. Information Processing Letters\u00a096, 59\u201366 (2005)","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0016","volume":"125","author":"N. Creignou","year":"1996","unstructured":"Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Information and Computation\u00a0125, 1\u201312 (1996)","journal-title":"Information and Computation"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Creignou, N., Kolaitis, P., Zanuttini, B.: Structure identification for Boolean relations and plain bases for co-clones. Journal of Computer and System Sciences (in press, 2008)","DOI":"10.1016\/j.jcss.2008.02.005"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1006\/jcss.1995.1087","volume":"51","author":"N. Creignou","year":"1995","unstructured":"Creignou, N.: A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences\u00a051, 511\u2013522 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-92800-3","volume-title":"Complexity of Constraints","author":"N. Creignou","year":"2008","unstructured":"Creignou, N., Vollmer, H.: Boolean constraint satisfaction problems: when does Post\u2019s lattice help? In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. Springer, Heidelberg (to appear, 2008)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0097539704446311","volume":"36","author":"N. Creignou","year":"2006","unstructured":"Creignou, N., Zanuttini, B.: A complete classification of the complexity of propositional abduction. SIAM Journal on Computing\u00a036(1), 207\u2013229 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10_CR15","first-page":"228","volume":"27","author":"D. Geiger","year":"1968","unstructured":"Geiger, D.: Closed systems of functions and predicates. Pac. J. Math.\u00a027(2), 228\u2013250 (1968)","journal-title":"Pac. J. Math."},{"key":"10_CR16","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P.G. Jeavons","year":"1998","unstructured":"Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoretical Computer Science\u00a0200, 185\u2013204 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/S0890-5401(03)00037-3","volume":"187","author":"L.M. Kirousis","year":"2003","unstructured":"Kirousis, L.M., Kolaitis, P.G.: The complexity of minimal satisfiability problems. Information and Computation\u00a0187(1), 20\u201339 (2003)","journal-title":"Information and Computation"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1137\/S0097539799349948","volume":"30","author":"S. Khanna","year":"2001","unstructured":"Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM Journal on Computing\u00a030, 1863\u20131920 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00037-005-0195-9","volume":"14","author":"D. Marx","year":"2005","unstructured":"Marx, D.: Parameterized complexity of constraint satisfaction problems. Computational Complexity\u00a014(2), 153\u2013183 (2005)","journal-title":"Computational Complexity"},{"key":"10_CR21","first-page":"1","volume":"5","author":"E.L. Post","year":"1941","unstructured":"Post, E.L.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies\u00a05, 1\u2013122 (1941)","journal-title":"Annals of Mathematical Studies"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01069627","volume":"17","author":"B.A. Romov","year":"1981","unstructured":"Romov, B.A.: The algebras of partial functions and their invariants. Cybernetics and Systems Analysis\u00a017(2), 157\u2013167 (1981)","journal-title":"Cybernetics and Systems Analysis"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(03)00092-0","volume":"186","author":"S. Reith","year":"2003","unstructured":"Reith, S., Vollmer, H.: Optimal satisfiability for propositional calculi and constraint satisfaction problems. Information and Computation\u00a0186(1), 1\u201319 (2003)","journal-title":"Information and Computation"},{"key":"10_CR24","first-page":"216","volume-title":"Proccedings 10th Symposium on Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proccedings 10th Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York (1978)"},{"key":"10_CR25","volume-title":"Complexity of Constraints","author":"H. Schnoor","year":"2008","unstructured":"Schnoor, H., Schnoor, I.: Partial polymorphisms and constraint satisfaction problems. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints. Springer, Heidelberg (to appear, 2008)"},{"issue":"3","key":"10_CR26","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00453-001-0019-5","volume":"30","author":"M.I. Sviridenko","year":"2001","unstructured":"Sviridenko, M.I.: Best possible approximation algorithm for MAX-SAT with cardinality constraint. Algorithmica\u00a030(3), 398\u2013405 (2001)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:12:11Z","timestamp":1715058731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}