Autonomous sets for the hypergraph of all canonical covers (Q429444): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Henning Koehler / rank
Normal rank
 
Property / author
 
Property / author: Henning Koehler / rank
 
Normal rank
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.1007/s10472-012-9276-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088954436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of nonredundant FD-covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Faithful Boyce-Codd Normal Form Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing unique canonical covers for simple FDs via transitive reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate keys for relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covers in Relational Database Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for existence of a covering Boyce-Codd normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new normal form for the design of relational database schemata / rank
 
Normal rank

Latest revision as of 09:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Autonomous sets for the hypergraph of all canonical covers
scientific article

    Statements

    Identifiers

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