A quadratic bound for the determinant and permanent problem

By T. Mignon, Nicolas Ressayre. 2004

96 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/7d733c9ad7aa6a4e461df60e133c55071e66b92e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Amir Yehudayoff
2. Bernd Sturmfels
3. Amir Shpilka
4. Jiawang Nie
5. Eric Katz
6. Jenia Tevelev
7. G. Mikhalkin
8. David E. Speyer

In Computational Theory and Mathematics

1. Jiawang Nie
2. Pablo A. Parrilo
3. Bernd Sturmfels
4. Amir Yehudayoff
5. Amir Shpilka
6. Martyn Marshall
7. Stephen Prajna
8. Petter Brand'en

In Electrical and Electronic Engineering

1. Pablo A. Parrilo
2. Bernd Sturmfels
3. Huy Tài Hà
4. E.J. Candes
5. B. Recht
6. Arindam Banerjee
7. Adam Van Tuyl

Citations in the corpus

• Semidefinite Representation of the k-Ellipse (2007, background): “These questions are closely related to finding the determinant complexity of a given polynomial, as discussed in [10].”
• Arithmetic Circuits: A survey of recent results and open questions (2010, background): “Currently, the best lower bounds on the dimension of such a matrix are given by the following theorem of [31, 92].”