Quantified conjunctive queries on partially ordered sets (Q2634671): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1587299800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking existential logic on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified Conjunctive Queries on Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constraint satisfaction games and QCSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Existential FO Model Checking on Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:36, 11 July 2024

scientific article
Language Label Description Also known as
English
Quantified conjunctive queries on partially ordered sets
scientific article

    Statements

    Quantified conjunctive queries on partially ordered sets (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2016
    0 references
    quantified conjunctive queries
    0 references
    posets
    0 references
    parameterized complexity
    0 references
    model checking
    0 references

    Identifiers