Skip to Main content Skip to Navigation
Book sections

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits

Abstract : We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of formulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in the convex geometry literature when applied to polynomials having a concise representation (as a sum of monomials, or more generally as an arithmetic formula or a weakly skew circuit). These representations are valid in any field of characteristic different from 2. In characteristic 2 we are led to an almost complete solution to a question of Bürgisser on the VNP-completeness of the partial permanent. In particular, we show that the partial permanent cannot be VNP-complete in a finite field of characteristic 2 unless the polynomial hierarchy collapses.
Complete list of metadatas
Contributor : Bruno Grenet <>
Submitted on : Monday, October 24, 2011 - 5:13:23 PM
Last modification on : Thursday, November 21, 2019 - 2:22:00 AM
Long-term archiving on: : Wednesday, January 25, 2012 - 2:40:25 AM


Files produced by the author(s)




Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier. Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits. Leonid Gurvits, Philippe Pebay, J. Maurice Rojas, David Thompson. Randomization, Relaxation, and Complexity in Polynomial Equation Solving, Amer. Math. Soc., pp.61-96, 2011, Contemporary Mathematics, 978-0-8218-5228-6. ⟨10.1090/conm/556⟩. ⟨ensl-00504925v4⟩



Record views


Files downloads