Quantified Conjunctive Queries on Partially Ordered Sets
From MaRDI portal
Publication:2946013
DOI10.1007/978-3-319-13524-3_11zbMath1456.68096arXiv1408.4263OpenAlexW2245088306MaRDI QIDQ2946013
Stefan Szeider, Robert Ganian, Simone Bova
Publication date: 15 September 2015
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4263
Partial orders, general (06A06) Specification and verification (program logics, model checking, etc.) (68Q60) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Quantified conjunctive queries on partially ordered sets ⋮ Quantified Conjunctive Queries on Partially Ordered Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- The complexity of constraint satisfaction games and QCSP
- Linear time solvable optimization problems on graphs of bounded clique-width
- Parametrized complexity theory.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Quantified Conjunctive Queries on Partially Ordered Sets
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Model checking existential logic on partially ordered sets
- Deciding First-Order Properties of Nowhere Dense Graphs
This page was built for publication: Quantified Conjunctive Queries on Partially Ordered Sets