Uniformly Automatic Classes of Finite Structures
From MaRDI portal
Publication:5090943
DOI10.4230/LIPIcs.FSTTCS.2018.10OpenAlexW2907647026MaRDI QIDQ5090943
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.10
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ehrenfeucht-Fraïssé goes automatic for real addition
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- The computational complexity of logical theories
- Linear time solvable optimization problems on graphs of bounded clique-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Automatic structures of bounded degree revisited
- An application of games to the completeness problem for formalized theories
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Factoring Groups Efficiently
- Deciding First-Order Properties of Nowhere Dense Graphs
- Advice Automatic Structures and Uniformly Automatic Classes
- A Faster Parameterized Algorithm for Treedepth
- Evaluation of an MSO-Solver
- Transforming structures by set interpretations
- First-Order Queries on Finite Abelian Groups
- Sur l'extension aux relations de quelques propriétés des ordres
This page was built for publication: Uniformly Automatic Classes of Finite Structures