Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference31 articles.
1. Agler, J., Helton, J.W., McCullough, S., Rodman, L.: Positive semidefinite matrices with a given sparsity pattern. Linear Algebra Appl. 107, 101–149 (1988)
2. Barvinok, A.: A Course in Convexity. Graduate Studies in Mathematics, vol. 54. American Mathematical Society, Providence (2002)
3. Ben-David, E.: Sharp lower and upper bounds for the Gaussian rank of a graph. J. Multivariate Anal. 139, 207–218 (2015)
4. Bernstein, D.I.: Completion of tree metrics and rank-2 matrices (2016).
arXiv:1612.06797
5. Blekherman, G.: Positive Gorenstein ideals. Proc. Am. Math. Soc. 143(1), 69–86 (2015)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献