Karp's NP-complete problems over first-order definable structures
From MaRDI portal
Cites work
- Automata Presenting Structures: A Survey of the Finite String Case
- Automata theory in nominal sets
- Automatic presentations of structures
- Automatic structures: twenty years later
- Finite presentations of infinite structures: Automata and interpretations
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1775445 (Why is no real title available?)
- scientific article; zbMATH DE number 6862042 (Why is no real title available?)
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Infinite versions of some problems from finite complexity theory
- Locally finite constraint satisfaction problems
- Nominal sets. Names and symmetry in computer science
- On free actions, minimal flows, and a problem by Ellis
- Orbit-finite linear programming
- Orbit-finite-dimensional vector spaces and weighted register automata
- Reducibility among combinatorial problems
- SMT solving for functional programming over infinite structures
- Solvability of orbit-finite systems of linear equations
- Some natural decision problems in automatic graphs
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
- Taking it to the limit: On infinite variants of NP-complete problems
- The undecidability of the domino problem
This page was built for publication: Karp's NP-complete problems over first-order definable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317490)
