Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Cardinality networks: a theoretical and empirical study;Asín;Constraints,2011
2. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Inform. Process. Lett.,1979
3. Complexity issues related to propagation completeness;Babka;Artificial Intelligence,2013
4. GAC via unit propagation;Bacchus,2007
5. Efficient CNF encoding of Boolean cardinality constraints;Bailleux,2003
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CNF Encodings of Symmetric Functions;Theory of Computing Systems;2024-03-26
2. A Constraint Programming Approach for QUBO Solving and Quantum Annealing;Companion Proceedings of the 8th International Conference on the Art, Science, and Engineering of Programming;2024-03-11
3. Encoding the At-Most-One Constraint for QUBO and Quantum Annealing: Experiments with the N-Queens problem;Proceedings of the Companion Conference on Genetic and Evolutionary Computation;2023-07-15
4. On the complexity of monotone circuits for threshold symmetric Boolean functions;Discrete Mathematics and Applications;2021-10-01