scientific article; zbMATH DE number 6866295
From MaRDI portal
Publication:4638054
DOI10.4230/LIPIcs.ITCS.2017.5zbMath1402.65041arXiv1610.00209MaRDI QIDQ4638054
Nick Ryder, Prasad Raghavendra, Nikhil Srivastava
Publication date: 3 May 2018
Full work available at URL: https://arxiv.org/abs/1610.00209
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Related Items (2)
Testing hyperbolicity of real polynomials ⋮ Definite determinantal representations via orthostochastic matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperbolic polynomials, interlacers, and sums of squares
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- Detecting rigid convexity of bivariate polynomials
- Fast algorithms for the characteristic polynomial
- The complexity of elementary algebra and geometry
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Computing sum of squares decompositions with rational coefficients
- Multivariate stable polynomials: theory and applications
- Negative dependence and the geometry of polynomials
- Linear matrix inequality representation of sets
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
- A generalization of permanent inequalities and applications in counting and optimization
- Hyperbolicity and stable polynomials in combinatorics and probability
- A Randomized Rounding Approach to the Traveling Salesman Problem
- A Note on Hyperbolic Polynomials.
This page was built for publication:
