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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10472-012-9276-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2088954436
@@ Property / OpenAlex ID: W2088954436 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4050122
@@ Property / cites work: Q4050122 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of nonredundant FD-covers
@@ Property / cites work: On the size of nonredundant FD-covers / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Faithful Boyce-Codd Normal Form Decompositions
+Normal rank
@@ Property / cites work @@
+Computing unique canonical covers for simple FDs via transitive reduction
+Normal rank
@@ Property / cites work @@
+Q4246397
@@ Property / cites work: Q4246397 / rank @@
+Normal rank
@@ Property / cites work @@
+Candidate keys for relations
@@ Property / cites work: Candidate keys for relations / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Covers in Relational Database Model
@@ Property / cites work: Minimum Covers in Relational Database Model / rank @@
+Normal rank
@@ Property / cites work @@
+Q3668890
@@ Property / cites work: Q3668890 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023862
@@ Property / cites work: Q4023862 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for existence of a covering Boyce-Codd normal form
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
+Normal rank
@@ Property / cites work @@
+A new normal form for the design of relational database schemata
+Normal rank