NP-complete problems simplified on tree schemas (Q1056539): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Semi-Joins to Solve Relational Queries / 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: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplied universal relation assumption and its properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Characterization of Tree Database Schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the universal instance assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic join dependency and data base projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections in acyclic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal objects and the semantics of universal relation databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Determining Tree Query Membership Of A Distributed Query / rank
 
Normal rank

Latest revision as of 09:43, 14 June 2024

scientific article
Language Label Description Also known as
English
NP-complete problems simplified on tree schemas
scientific article

    Statements

    NP-complete problems simplified on tree schemas (English)
    0 references
    0 references
    0 references
    1983
    0 references
    tree schemas
    0 references
    relational database
    0 references
    NP-complete problems
    0 references
    satisfiability
    0 references
    hypergraph coloring
    0 references
    minimum cover
    0 references

    Identifiers