From Holroyd’s sorting networks picture gallery
A celebrated theorem of Ajtai, Komlos and Szemeredi describes a sorting network for $n$ numbers of depth $O(log N)$. rounds where in each runs $n/2$. Tim Gowers proposes to find collectively a randomized sorting with the same properties.
RSS feed for comments on this post. TrackBack URI
 | Anonymous on Polymath10 is now open |
| Anonymous on Draft version of polymath4… |
| Anonymous on Rota’s Basis Conjecture:… |
| Anonymous on Rota’s Basis Conjecture:… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Non-transitive Dice over Gower… |
| Anonymous on Two polymath (of a sort) propo… |
| Anonymous on Two polymath (of a sort) propo… |
Polymath Wiki – most recent changes
The polymath blog 
Having read this I believed it was rather enlightening.
I appreciate you spending some time and effort to put this information together.
I once again find myself personally spending a lot of time both
reading and posting comments. But so what, it was still worthwhile!
Comment by Hotel Konradowka — August 7, 2013 @ 10:38 am |
For latest news you have to go to see the web and on web I
found this web page as a best web page for hottest updates.
Comment by Lawerence — August 13, 2013 @ 11:15 am |