Author:
Codish Michael,Zazon-Ivry Moshe
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Lecture Notes in Computer Science;R. Asín,2009
2. AFIPS Conference Proceedings;K.E. Batcher,1968
3. Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. Theory and Practice of Logic Programming 8(1), 121–128 (2008)
4. Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into sat. JSAT 2(1-4), 1–26 (2006)
5. Sorting and Searching;D.E. Knuth,1973
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast median filters using separable sorting networks;ACM Transactions on Graphics;2021-08-31
2. Chapter 4. Conflict-Driven Clause Learning SAT Solvers;Frontiers in Artificial Intelligence and Applications;2021-02-02
3. Chapter 2. CNF Encodings;Frontiers in Artificial Intelligence and Applications;2021-02-02
4. Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks;Theory and Applications of Satisfiability Testing – SAT 2020;2020
5. Sorting networks: To the end and back again;Journal of Computer and System Sciences;2019-09