Prefer a chat interface with context about you and your work?
Approximating the Largest Root and Applications to Interlacing Families
We study the problem of approximating the largest root of a real-rooted polynomial of degree n using its top k coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in k that use the top k coefficients to approximate the maximum root within …