Leonid Gurvits
Symposium on the Theory of Computing · 2002–2008
A researcher in the Science corpus: 5 papers; trusts 3 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Whom Leonid Gurvits trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Leonid Gurvits overall
- Martin Idel
- Aram Wettroth Harrow
- John Watrous
- Michael B. Cohen
- Ingemar Bengtsson
- Benoît Collins
- Alexander I. Barvinok
- Nicolai Friis
- Robert N. Shorten
- Aleksander Madry
Papers from Leonid Gurvits's perspective
Ordered by how strongly the researchers Leonid Gurvits trusts endorse each paper. Same corpus, a different order for every researcher.
- Topics in Matrix Analysis
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds (Symposium on the Theory of Computing)
- Submodular Functions, Matroids, and Certain Polyhedra (Combinatorial Optimization)
- The Second Eigenvalue of the Google Matrix
- The Complexity of Computing the Permanent
- Probabilistic checking of proofs: a new characterization of NP
- PRIMES is in P
- Probabilistic algorithms for sparse polynomials
- I Computational Complexity
Their papers
- Classical complexity and quantum entanglement (2004) — 311 citations
- On the Stability of Switched Positive Linear Systems (2007) — 370 citations
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement (2003) — 509 citations
- On multivariate Newton-like inequalities (2008) — 57 citations
- Largest separable balls around the maximally mixed bipartite quantum state (2002) — 228 citations