scientific article; zbMATH DE number 7802069

zbMath1530.68126arXiv2209.10311MaRDI QIDQ6191003

Martin Lange, Florian Bruse, Unnamed Author

Publication date: 8 February 2024

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cites Work

• Model-checking process equivalences
• Results on the propositional \(\mu\)-calculus
• Space-efficient fragments of higher-order fixpoint logic
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
• A lattice-theoretical fixpoint theorem and its applications
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: