Uniformly Automatic Classes of Finite Structures
From MaRDI portal
Publication:5090943
Recommendations
- Analysing Complexity in Classes of Unary Automatic Structures
- Advice Automatic Structures and Uniformly Automatic Classes
- Automatic structures of bounded degree revisited
- Climbing up the elementary complexity classes with theories of automatic structures
- Automatic Structures: Richness and Limitations
Cites work
- scientific article; zbMATH DE number 6678444 (Why is no real title available?)
- scientific article; zbMATH DE number 5794052 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- A faster parameterized algorithm for treedepth
- Advice Automatic Structures and Uniformly Automatic Classes
- An application of games to the completeness problem for formalized theories
- Automatic structures of bounded degree revisited
- Ehrenfeucht-Fraïssé goes automatic for real addition
- Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
- Evaluation of an MSO-Solver
- Factoring Groups Efficiently
- First-order queries on finite abelian groups
- Linear time solvable optimization problems on graphs of bounded clique-width
- Sur l'extension aux relations de quelques propriétés des ordres
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The computational complexity of logical theories
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Transforming structures by set interpretations
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
Cited in
(3)
This page was built for publication: Uniformly Automatic Classes of Finite Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090943)
