Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6873770 | Information and Computation | 2018 | 15 Pages |
Abstract
We study generalizations of the comparator circuit model that work over fixed finite bounded posets. We observe that there are universal comparator circuits even over arbitrary fixed finite bounded posets. Building on this, we show the following:
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Balagopal Komarath, Jayalal Sarma, K.S. Sunil,