On the complexity of mixed discriminants and related problems

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 447-458

  Gurvits, Leonid ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

POLY-TIME ALGORITHMS; SEMIDEFINITE MATRICES;

COMPUTATIONAL COMPLEXITY;

EID: 26844433633     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_39     Document Type: Conference Paper

References (27)

1. A. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes (in Russian), Mat. Sb. (N.S.) 3 (1938), 227-251.
2. R. B. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra and its Applications 126, 107-124, 1989.
3. A. I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Permanents, Discrete & Computational Geometry, 18 (1997), 205-237.
4. L.Gurvits, Classical complexity and Quantum Entanglement, Jour, of Comp. and Sys. Sciences (JCSS) 69 (2004) 448-484.
5. A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms, 14 (1999), 29-61.
6. A. I. Barvinok, Two algorithmic results for the Traveling Salesman Problem, Math. Oper. Res. 21 (1996), 65-84 (2001 version from researchindex.com).
7. L.Gurvits, Classical deterministic complexity of Edmonds' problem and Quantum entanglement, Proc. of 35 annual ACM symposium on theory of computing, San Diego, 2003.
8. L. Gurvits and A. Samorodnitsky, A deterministic algorithm for approximating mixed discriminant and mixed volume, and a combinatorial corollary, Discrete and Computational Geometry 27: 531-550, 2002.
9. M. Dyer, P. Gritzmann and A. Hufnagel, On the complexity of computing mixed volumes, SIAM J. Comput., 27(2), 356-400, 1998.
10. L .Gurvits, Classical deterministic complexity of Edmonds' problem and Quantum entanglement, to appear in Proc. of 35 annual ACM symposium on theory of computing (STOC2003), San Diego, 2003.
11. G.P. Egorychev, The solution of van der Waerden's problem for permanents, Advances in Math., 42, 299-305, 1981.
12. D.I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki 29, 6: 931-938, 957, 1981, (in Russian).
13. C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, 1993.
14. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
15. L. Gurvits, Van der Waerden Conjecture for Mixed Discriminants, Advances in Mathematics, 2005. (Available at the journal web page.)
16. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput., 18, 1149-1178, 1989.
17. M. Jerrum, A. Sinclair and E. Vigoda, A polynomial time approximation algorithm for the permanent of a matrix with non-negative entries, ECCC, Report No. 79, 2000.
18. L.Gurvits and A.Samorodnitsky, A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume, Proc. 32 ACM Symp. on Theory of Computing, ACM, 2000.
19. N. Karmarkar, R. Karp, R. Lipton, L. Lovasz and M. Luby, A Monte-Carlo algorithm for estimating the permanent, SIAM J. Comput., 22(2), 284-293, 1993.
20. G. Vidal, Efficient classical simulation of slightly entangled quantum computations, 2003, available at http://arxiv.org/abs/quant-ph/0301063
21. N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
22. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 8(2), 189-201, 1979.
23. K. Mulmuley and M. Sohoni, Geometric complexity theory 1: an approach to the P vs. NP and related problems, SIAM J. Comput., vol. 31, No. 2, pp. 496-526.
24. L. Valiant, Quantum computers that can be simulated classically in polynomial time, Proc. 33 ACM Symp. on Theory of Computing, ACM, 2001.
25. K. Regan, Understanding the Mulmeley-Sohoni approach to P vs. NP, unpublished manuscript, 2002.
26. J.-G. Luque, J.-Y. Thibon, Hankel hyperdeterminants and Selberg integrals, J.Phys.A: Math. Gen. 36 (2003) 5267-5292.
27. L. Gurvits, On the complexity of mixed discriminants and related problems, Los Alamos Unclassified Technical Report, 2005.