Perfect Hashing and CNF Encodings of Cardinality Constraints-Reference-Cited by-同舟云学术

Perfect Hashing and CNF Encodings of Cardinality Constraints

Published:2012 Issue: Volume: Page:397-409
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2012
language:
Short-container-title:

Author:

Ben-Haim Yael,Ivrii Alexander,Margalit Oded,Matsliah Arie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31612-8_30.pdf

Reference13 articles.

1. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4/5), 434–449 (1996)

2. Lecture Notes in Computer Science;R. Asín,2009

3. Bailleux, O.: On the expressive power of unit resolution. Technical Report arXiv:1106.3498 (June 2011)

4. Lecture Notes in Computer Science;O. Bailleux,2003

5. Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009, pp. 412–418. Morgan Kaufmann Publishers Inc., San Francisco (2009)

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

1. Machine Learning for Feature-Based Analytics;Proceedings of the 2018 International Symposium on Physical Design;2018-03-25

2. A Lower Bound on CNF Encodings of the At-Most-One Constraint;Theory and Applications of Satisfiability Testing – SAT 2017;2017

3. A New Method to Encode the At-Most-One Constraint into SAT;Proceedings of the Sixth International Symposium on Information and Communication Technology;2015-12-03

4. meSAT: multiple encodings of CSP to SAT;Constraints;2014-06-17

5. Detecting Cardinality Constraints in CNF;Lecture Notes in Computer Science;2014