Locally finite constraint satisfaction problems
From MaRDI portal
Recommendations
Cited in
(16)- Limit Behavior of Locally Consistent Constraint Satisfaction Problems
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
- A dichotomy for first-order reducts of unary structures
- The language of stratified sets is confluent and strongly normalising
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Linear equations with ordered data
- SMT solving for functional programming over infinite structures
- Canonical functions: a proof via topological dynamics
- scientific article; zbMATH DE number 7147443 (Why is no real title available?)
- Affine Systems of Equations and Counting Infinitary Logic
- A Characterisation of First-Order Constraint Satisfaction Problems
- Graph-Theoretic Concepts in Computer Science
- Solvability of orbit-finite systems of linear equations
- Orbit-finite linear programming
- Karp's NP-complete problems over first-order definable structures
This page was built for publication: Locally finite constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635828)