scientific article; zbMATH DE number 7533345
From MaRDI portal
Publication:5079744
DOI10.4230/LIPIcs.CSL.2018.20MaRDI QIDQ5079744
Publication date: 28 May 2022
Full work available at URL: https://arxiv.org/abs/1804.02939
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
circuitscircuit characterizationfixed-point logic with ranksymmetric circuitsuniform families of circuitscircuit frameworkfinite model theory, descriptive complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Elements of finite model theory.
- Logical hierarchies in PTIME
- On symmetric circuits and fixed-point logics
- On Symmetric and Choiceless Computation
- Definability of linear equation systems over groups and rings
- Pebble Games with Algebraic Rules
- Relational queries computable in polynomial time
- Definability by constant-depth polynomial-size circuits
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Rank logic is dead, long live rank logic!
This page was built for publication:
