On Symmetric Circuits and Fixed-Point Logics
On Symmetric Circuits and Fixed-Point Logics
复制标题
对称电路和定点逻辑
DOI:
10.1007/s00224-016-9692-2
复制
发表时间:
2016
影响因子:
0.5
通讯作者:
Anderson M
中科院分区:
文献类型:
--
作者:
Anderson M
We study properties of relational structures, such as graphs, that are decided by families of Boolean circuits. Circuits that decide such properties are necessarily invariant to permutations of the elements of the input structures. We focus on families of circuits that are symmetric, i.e., circuits whose invariance is witnessed by automorphisms of the circuit induced by the permutation of the input structure. We show that the expressive power of such families is closely tied to definability in logic. In particular, we show that the queries defined on structures by uniform families of symmetric Boolean circuits with majority gates are exactly those definable in fixed-point logic with counting. This shows that inexpressibility results in the latter logic lead to lower bounds against polynomial-size families of symmetric circuits.
登录
查看更多内容
DOI:
10.1109/lics.2013.23
发表时间:
2013
期刊:
--
影响因子:
--
作者:
Anderson M
通讯作者:
Anderson M
DOI:
--
发表时间:
1997
期刊:
Lecture Notes in Logic
影响因子:
--
作者:
M. Otto
通讯作者:
M. Otto
影响因子:
0.8
作者:
A. Blass;Y. Gurevich;S. Shelah
通讯作者:
S. Shelah
DOI:
10.1016/j.apal.2007.11.011
发表时间:
2008
期刊:
Ann. Pure Appl. Log.
影响因子:
--
作者:
A. Dawar;David Richerby;Benjamin Rossman
通讯作者:
Benjamin Rossman
DOI:
10.1007/978-3-662-21676-7
发表时间:
1997
期刊:
Electron. J. Comb.
影响因子:
--
作者:
M. Otto
通讯作者:
M. Otto