Symmetric Circuits for Rank Logic

DOI10.1145/3476227MaRDI QIDQ5056365zbMATH OpenOpenAlexWikidataFDO

Authors Anuj Dawar, Gregory Wilsenach

Publication date 8 December 2022

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3476227

zbMATH Keywords

circuit characterizationcircuit complexitycircuit frameworksdescriptive complexityfinite model theoryfixed-point logic with rankfixed-point logicssymmetric circuitsuniform families of circuits

Mathematics Subject Classification ID

Logic in computer science (03B70) Networks and circuits as models of computation; circuit complexity (68Q06) Descriptive complexity and finite models (68Q19) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Rank logic is dead, long live rank logic!
• Rank logic is dead, long live rank logic!
• scientific article; zbMATH DE number 6691390
• On symmetric circuits and fixed-point logics
• Computer Science Logic

Cited in

(7)

• On symmetric circuits and fixed-point logics
• scientific article; zbMATH DE number 6691390 (Why is no real title available?)
• Rank logic is dead, long live rank logic!
• Symmetric circuits for rank logic
• Rank logic is dead, long live rank logic!
• Symmetric arithmetic circuits
• Limits of symmetric computation (invited talk)

This page was built for publication: Symmetric Circuits for Rank Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056365)