The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439): 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 / OpenAlex ID
 
Property / OpenAlex ID: W3204154240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs with treewidth 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Is in DynFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5376663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrecursive incremental evaluation of Datalog queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic complexity of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / 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: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5276194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyn-FO: A parallel, dynamic complexity class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Complexity under Definable Changes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5028429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic descriptive complexity of \(k\)-clique / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:05, 29 July 2024

scientific article
Language Label Description Also known as
English
The dynamic complexity of acyclic hypergraph homomorphisms
scientific article

    Statements

    The dynamic complexity of acyclic hypergraph homomorphisms (English)
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    0 references
    dynamic complexity
    0 references
    conjunctive queries
    0 references
    hypergraph homomorphisms
    0 references
    0 references