scientific article; zbMATH DE number 7533345

DOI10.4230/LIPICS.CSL.2018.20MaRDI QIDQ5079744FDOQ5079744

Authors: Anuj Dawar, Gregory Wilsenach 

Publication date: 28 May 2022

Full work available at URL: https://arxiv.org/abs/1804.02939

Title of this publication is not available (Why is that?)

zbMATH Keywords

circuitscircuit characterizationfixed-point logic with ranksymmetric circuitsuniform families of circuitscircuit frameworkfinite model theory, descriptive complexity

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Elements of finite model theory.
• Relational queries computable in polynomial time
• Logical hierarchies in PTIME
• Definability by constant-depth polynomial-size circuits
• Pebble Games with Algebraic Rules
• Rank logic is dead, long live rank logic!
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• On symmetric circuits and fixed-point logics
• Title not available (Why is that?)
• On Symmetric and Choiceless Computation
• Definability of linear equation systems over groups and rings

Cited In (2)

• On symmetric circuits and fixed-point logics
• Title not available (Why is that?)

This page was built for publication:

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