The following pages link to Leonid Gurvits (Q818048):
Displayed 42 items.
- The Van der Waerden conjecture for mixed discriminants (Q818049) (← links)
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all (Q1010786) (← links)
- A short proof, based on mixed volumes, of Liggett's theorem on the convolution of ultra-logconcave sequences (Q1010896) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Controllability and completion of partial upper triangular matrices over rings (Q1194515) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- Positivity and strict contractivity of functions of operators (Q1378074) (← links)
- Vandermonde matrices, NP-completeness and transversal subspaces (Q1430506) (← links)
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary (Q1611062) (← links)
- Controllability by completions of partial upper triangular matrices (Q1802199) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- Stability of discrete linear inclusion (Q1906759) (← links)
- Markov property for a function of a Markov chain: A linear algebra approach (Q2484388) (← links)
- Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
- A Note on VC-Dimension and Measure of Sets of Reals (Q2709844) (← links)
- A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums (Q2849938) (← links)
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures (Q2931405) (← links)
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (Q3191970) (← links)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement (Q3581264) (← links)
- On multivariate Newton-like inequalities (Q3656247) (← links)
- (Q3994325) (← links)
- Trace inequalities and linear programming (with applications to markov chains (Q4208346) (← links)
- An Upper Bound for the Real Part of Nonmaximal Eigenvalues of Nonnegative Irreducible Matrices (Q4305408) (← links)
- Near-optimal nonholonomic motion planning for a system of coupled rigid bodies (Q4306693) (← links)
- Convergence of Polynomially Bounded Semigroups of Matrices (Q4337386) (← links)
- (Q4370230) (← links)
- (Q4395703) (← links)
- On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability (Q4974461) (← links)
- On Matrix Polynomials with Real Roots (Q5317625) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492879) (← links)
- Counting matchings via capacity-preserving operators (Q5886121) (← links)
- Capacity lower bounds via productization (Q6087049) (← links)
- Bounds on the permanent and some applications (Q6253689) (← links)
- Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices (Q6285403) (← links)
- Counting Matchings via Capacity Preserving Operators (Q6300258) (← links)
- From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP (Q6459499) (← links)
- Combinatorics hidden in hyperbolic polynomials and related topics (Q6473616) (← links)
- Combinatorial and algorithmic aspects of hyperbolic polynomials (Q6473927) (← links)
- A proof of hyperbolic van der Waerden conjecture : the right generalization is the ultimate simplification (Q6475418) (← links)
- Generalized Friedland-Tverberg inequality: applications and extensions (Q6476883) (← links)
- Stability Testing of Matrix Polytopes (Q6478166) (← links)