In a recent preprint, Siddharth Bhandari and Abhishek Khetan have improved the decades old upper bound on the trifference problem by using a clever combinatorial argument involving extremal graph t…
No pages have linked to this URL yet.
Log in or sign up to submit feeds.