Pages that link to "Item:Q2276961"

The following pages link to On minimum matrix representation of closure operations (Q2276961):

Displaying 14 items.

• Recent combinatorial results in the theory of relational databases (Q596957) (← links)
• General symmetric starter of orthogonal double covers of complete bipartite graph (Q925408) (← links)
• Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics (Q1193847) (← links)
• Design type problems motivated by database theory (Q1299042) (← links)
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
• Minimum matrix representation of some key system (Q1348397) (← links)
• A survey of some combinatorial results concerning functional dependencies in database relations. (Q1353952) (← links)
• Orthogonal double covers of complete graphs by trees (Q1376062) (← links)
• Minimum matrix representation of Sperner systems (Q1382250) (← links)
• Orthogonal double covers of \(K_{n,n}\) by small graphs. (Q1428552) (← links)
• Orthogonal double covers of general graphs. (Q1428558) (← links)
• New type of coding problem motivated by database theory (Q1885817) (← links)
• Coding Theory Motivated by Relational Databases (Q3092324) (← links)
• Partitions with certain intersection properties (Q3100729) (← links)