New lower bounds for CDS and $f$-routing
New lower bounds tie robust CDS randomness to communication complexity and inner-product routing entanglement to sign rank.
1 stories, newest first · one card per story
New lower bounds tie robust CDS randomness to communication complexity and inner-product routing entanglement to sign rank.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views