Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If you're looking for a proof that the Benesh network can implement any permutation (of size 2^n):

https://eng.libretexts.org/Bookshelves/Computer_Science/Prog...

The proof is not super complicated, but it for sure isn't trivial.



The author seems to think it's a simple exercise, but I agree with you, the proof that you linked, which uses graph coloring, and those in the Beneš or Waksman articles, which use Hall's theorem, are per se easy to understand, but rather hard to come up with.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: