Pairwise cardinality networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6355 LNAI, Issue , 2010, Pages 154-172

  Codish, Michael ^a   Zazon Ivry, Moshe ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; CARDINALITY CONSTRAINTS; ODD-EVEN SORTING; PROPAGATION PROPERTIES; SORTING NETWORK;

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS;

ARTIFICIAL INTELLIGENCE;

EID: 78650817430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17511-4_10     Document Type: Conference Paper

References (8)

1. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez- Carbonell, E.: Cardinality networks and their applications. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 167-180. Springer, Heidelberg (2009)
2. Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol. 32, pp. 307-314. Thomson Book Company, Washington (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. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)
6. Parberry, I.: Parallel Complexity Theory. Research Notes in Theoretical Computer Science. Pitman Publishing, London (1987)
7. Parberry, I.: The pairwise sorting network. Parallel Processing Letters 2, 205-211 (1992)
8. Wah, B.W., Chen, K.-L.: A partitioning approach to the design of selection networks. IEEE Trans. Computers 33(3), 261-268 (1984)