文章基本信息

标题：Symmetric Circuits for Rank Logic
本地全文：下载
作者：Anuj Dawar ; Gregory Wilsenach
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2018
卷号：119
页码：1-16
DOI：10.4230/LIPIcs.CSL.2018.20
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Fixed-point logic with rank (FPR) is an extension of fixed-point logic with counting (FPC) with operators for computing the rank of a matrix over a finite field. The expressive power of FPR properly extends that of FPC and is contained in P, but it is not known if that containment is proper. We give a circuit characterization for FPR in terms of families of symmetric circuits with rank gates, along the lines of that for FPC given by [Anderson and Dawar 2017]. This requires the development of a broad framework of circuits in which the individual gates compute functions that are not symmetric (i.e., invariant under all permutations of their inputs). This framework also necessitates the development of novel techniques to prove the equivalence of circuits and logic. Both the framework and the techniques are of greater generality than the main result.
关键词：fixed-point logic with rank; circuits; symmetric circuits; uniform families of circuits; circuit characterization; circuit framework; finite model the