@article{HI-Binary-Determinantal-Complexity,
Title = {Binary determinantal complexity},
Author = {Jesko HÃ¼ttenhain and Christian Ikenmeyer},
Pages = {559 - 573},
Year = {2016},
Issn = {0024-3795},
Doi = {10.1016/j.laa.2016.04.027},
Journal = {Linear Algebra and its Applications},
Volume = {504},
Month = {09},
Abstract = {We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite graphs. Furthermore, we analyze sequences of polynomials that are determinants of polynomially sized matrices consisting only of zeros, ones, and variables. We show that these are exactly the sequences in the complexity class of constant free polynomially sized (weakly) skew circuits.},
Url = {http://arxiv.org/abs/1410.8202},
Url2 = {http://www3.math.tu-berlin.de/algebra/work/bdc.pdf}
}