Pages that link to "Item:Q1299042"
From MaRDI portal
The following pages link to Design type problems motivated by database theory (Q1299042):
Displaying 14 items.
- The two-row constraints realization problem (Q1096396) (← links)
- Perfect error-correcting databases (Q1813978) (← links)
- New type of coding problem motivated by database theory (Q1885817) (← links)
- Codes that attain minimum distance in every possible direction (Q2425557) (← links)
- Constructions via Hamiltonian theorems (Q2576854) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
- Partitions with certain intersection properties (Q3100729) (← links)
- SPT(q, k, n)-Codes (Q3503498) (← links)
- Optimal Codes in the Enomoto-Katona Space (Q5364232) (← links)
- On the Existence of Armstrong Instances with Bounded Domains (Q5445299) (← links)
- Refinements of complexity results on type consistency for object-oriented databases (Q5946054) (← links)
- The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs (Q6056724) (← links)
- Minimal Armstrong databases for cardinality constraints (Q6630187) (← links)
- A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs (Q6633536) (← links)