Unifying Boolean and algebraic descriptive complexity

DOI10.4230/LIPICS.FSCD.2025.13MaRDI QIDQ7296808zbMATH OpenFDO

Authors Baptiste Chanus, Damiano Mazza, Morgan Rogers

Publication date 14 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2025.13

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Arboreal Categories: An Axiomatic Theory of Resources
• Classifying vectoids and operad kinds
• Concurrent games over relational structures: the origin of game comonads
• Descriptive complexity
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 1263207 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• Introduction to extensive and distributive categories
• New Approach to Arakelov Geometry
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Relating structure and power: Comonadic semantics for computational resources
• Relational queries computable in polynomial time
• Tensor categorical foundations of algebraic geometry
• Tensor functors between categories of quasi-coherent sheaves
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• The fundamental pro-groupoid of an affine 2-scheme

This page was built for publication: Unifying Boolean and algebraic descriptive complexity

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