An Improved Lower Bound for Sorting Networks

DOI10.1109/TC.1972.5009021zbMath0236.94023MaRDI QIDQ5646780

David C. van Voorhis

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items

Efficient monotone circuits for threshold functions, A computer-assisted optimal depth lower bound for nine-input sorting networks, Sorting networks: to the end and back again, Sorting nine inputs requires twenty-five comparisons, Boolean functions whose monotone complexity is of size \(n^ 2\) / log n