Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?-Reference-Cited by-同舟云学术

Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

Published:2008 Issue: Volume: Page:3-37
ISSN:0302-9743
Container-title:Complexity of Constraints
language:
Short-container-title:

Author:

Creignou Nadia,Vollmer Heribert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92800-3_2

Reference78 articles.

1. Lecture Notes in Computer Science;E. Allender,2005

2. Lecture Notes in Computer Science;M. Agrawal,2001

3. Bauland, M., Böhler, E., Creignou, N., Reith, S., Schnoor, H., Vollmer, H.: The complexity of problems for quantified constraints. Technical Report 07-023, Electronic Colloquium on Computational Complexity (2007)

4. Lecture Notes in Computer Science;M. Bauland,2005

5. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. ACM-SIGACT Newsletter 34(4), 38–52 (2003)

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Functional completeness and primitive positive decomposition of relations on finite domains;Logic Journal of the IGPL;2024-06-01

2. On NP-Complete Search Problems on Finite Algebras;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28

3. On when the union of two algebraic sets is algebraic;Aequationes mathematicae;2024-04-26

4. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework;ACM Transactions on Computational Logic;2023-05-10

5. Belief contraction and erasure in fragments of propositional logic;Journal of Logic and Computation;2022-03-11