A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume

Authors:
Leonid Gurvits;Alex Samorodnitsky
Affiliations:
NECI, Princeton;Institute for Advanced Study and DIMACS
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Classical complexity and quantum entanglement

Journal of Computer and System Sciences - Special issue: STOC 2003
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the complexity of mixed discriminants and related problems

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Hi-index	0.00