Lower Bounds for Symmetric Circuits for the Determinant
Lower Bounds for Symmetric Circuits for the Determinant
复制标题
行列式对称电路的下界
DOI:
10.4230/lipics.itcs.2022.52
复制
发表时间:
2021
影响因子:
5.6
通讯作者:
G. Wilsenach
中科院分区:
文献类型:
--
作者:
A. Dawar;G. Wilsenach
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithmetic circuits and show an exponential separation between the sizes of symmetric circuits for computing the determinant and the permanent. The symmetry restriction is that the circuits which take a matrix input are unchanged by a permutation applied simultaneously to the rows and columns of the matrix. Under such restrictions we have polynomial-size circuits for computing the determinant but no subexponential size circuits for the permanent. Here, we consider a more stringent symmetry requirement, namely that the circuits are unchanged by arbitrary even permutations applied separately to rows and columns, and prove an exponential lower bound even for circuits computing the determinant. The result requires substantial new machinery. We develop a general framework for proving lower bounds for symmetric circuits with restricted symmetries, based on a new support theorem and new two-player restricted bijection games. These are applied to the determinant problem with a novel construction of matrices that are bi-adjacency matrices of graphs based on the CFI construction. Our general framework opens the way to exploring a variety of symmetry restrictions and studying trade-offs between symmetry and other resources used by arithmetic circuits.
登录
查看更多内容
DOI:
--
发表时间:
2020
期刊:
--
影响因子:
--
作者:
Anuj Dawar
通讯作者:
Anuj Dawar
影响因子:
0.5
作者:
Anderson M
通讯作者:
Anderson M
DOI:
10.1109/lics.2019.8785792
发表时间:
2019
期刊:
--
影响因子:
--
作者:
Atserias A
通讯作者:
Atserias A
DOI:
--
发表时间:
2020
期刊:
--
影响因子:
--
作者:
Anuj Dawar
通讯作者:
Anuj Dawar