Hereditary first-order logic: the tractable quantifier prefix classes
From MaRDI portal
Cites work
- A fast algorithm and Datalog inexpressibility for temporal reasoning
- A Note on Consistent Ordering and Zero Circulation
- A unified approximation algorithm for node-deletion problems
- Algorithmic Aspects of Vertex Elimination on Graphs
- Complexity of infinite-domain constraint satisfaction
- Datalog-expressibility for monadic and guarded second-order logic
- Existential second-order logic over graphs: charting the tractability frontier
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Finding odd cycle transversals.
- Graph theory
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 2112986 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Node-Deletion NP-Complete Problems
- On the descriptive complexity of vertex deletion problems
- On the parameterized complexity of graph modification to first-order logic properties
- Optimization, approximation, and complexity classes
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
- The node-deletion problem for hereditary properties is NP-complete
This page was built for publication: Hereditary first-order logic: the tractable quantifier prefix classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445658)