On the complexity of existential positive queries (Q5410336): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width for first order formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> ! lower bound on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preservation under homomorphisms and unions of conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of intractable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with succinctly specified relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / 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: The succinctness of first-order logic on linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Positive First-Order Logic without Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable structures for constraint satisfaction with truth tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation theorems / rank
 
Normal rank

Latest revision as of 10:40, 8 July 2024

scientific article; zbMATH DE number 6285715
Language Label Description Also known as
English
On the complexity of existential positive queries
scientific article; zbMATH DE number 6285715

    Statements

    On the complexity of existential positive queries (English)
    0 references
    0 references
    16 April 2014
    0 references
    compilation
    0 references
    first-order logic
    0 references
    fixed-parameter tractability
    0 references
    model checking
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references