Abstract
A sorting network is a combinational circuit for sorting, constructed from comparison-swap units. The depth of such a circuit is a measure of its running time. It is reasonable to hypothesize that only the fastest (that is, the shallowest) networks are likely to be fabricated. It is shown that the problem of verifying that a given sorting network actually sorts is Co-MV complete even for sorting networks of depth only 4flogn] + 0(1) greater than optimal. This is shallower than previous depth bounds by a factor of two.
Cite
CITATION STYLE
Parberry, I. (1991). On the computational complexity of optimal sorting network verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 505 LNCS, pp. 252–269). Springer Verlag. https://doi.org/10.1007/978-3-662-25209-3_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
