The following pages link to (Q3919122):
Displaying 19 items.
- Recent combinatorial results in the theory of relational databases (Q596957) (← links)
- Minimum matrix representation of closure operations (Q1065561) (← links)
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions (Q1176724) (← links)
- Design type problems motivated by database theory (Q1299042) (← links)
- Minimum matrix representation of some key system (Q1348397) (← links)
- Orthogonal double covers of general graphs. (Q1428558) (← links)
- On cyclic orthogonal double covers of circulant graphs by special infinite graphs (Q1680882) (← links)
- Perfect error-correcting databases (Q1813978) (← links)
- New type of coding problem motivated by database theory (Q1885817) (← links)
- On the distance of databases (Q1928825) (← links)
- Codes that attain minimum distance in every possible direction (Q2425557) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
- SPT(q, k, n)-Codes (Q3503498) (← links)
- Extremal problems in relational data bases (Q3698337) (← links)
- Dependencies in composite databases (Q3750155) (← links)
- ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS (Q5151278) (← links)
- On the Existence of Armstrong Instances with Bounded Domains (Q5445299) (← links)
- The novel generally described graphs for cyclic orthogonal double covers of some circulants (Q6059285) (← links)
- Minimal Armstrong databases for cardinality constraints (Q6630187) (← links)
