The content analyzes the computational complexity of testing various properties of polynomials, including real stability, complete log concavity, and log concavity.
Key highlights:
The content provides a detailed analysis of the hierarchy of stable, Lorentzian, and log-concave polynomials, and establishes the computational complexity of testing these properties. The results shed light on the inherent difficulty of working with these important classes of polynomials.
Vers une autre langue
à partir du contenu source
arxiv.org
Questions plus approfondies