From Computerphile.

A seemingly simple problem that’s "in general" incredibly difficult! CEO of Redwood Research Buck Shlegeris explains his favourite algorithmic fact!

Buck wants to thank his friend Peter Schmidt-Nielsen for telling him this great fact. More on the sums of square roots problem: https://cstheory.stackexchange.com/questions/79/problems-between-p-and-npc#4010

Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile

This video was filmed and edited by Sean Riley.

Computerphile is a sister project to Brady Haran’s Numberphile. More at https://www.bradyharanblog.com