search

bertdobbelaere / SorterHunter

An evolutionary approach to find small and low latency sorting networks
MIT License
55 stars 4 forks source link

Depth Optimality Proof for n=9 and n=10 #4

Closed Topsii closed 2 years ago

Topsii commented 3 years ago

The optimal depth for n=9 and n=10 was proven by Ian Parberry in A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks. I think it was first published as A computer assisted optimal depth lower bound for sorting networks with nine inputs in Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing.

bertdobbelaere commented 2 years ago

Update the table, thanks for the suggestion.