Symmetric Circuits for Rank Logic
DOI10.1145/3476227OpenAlexW3215989809WikidataQ130808775 ScholiaQ130808775MaRDI QIDQ5056365
Publication date: 8 December 2022
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3476227
circuit complexityfinite model theorydescriptive complexityfixed-point logicscircuit characterizationcircuit frameworksfixed-point logic with ranksymmetric circuitsuniform families of circuits
Logic in computer science (03B70) Descriptive complexity and finite models (68Q19) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)
This page was built for publication: Symmetric Circuits for Rank Logic