Pages that link to "Item:Q1229752"
From MaRDI portal
The following pages link to On the complexity of finding the set of candidate keys for a given set of functional dependencies (Q1229752):
Displaying 5 items.
- Some generalized type functional dependencies formalized as equality set on matrices (Q790628) (← links)
- The complexity of recognizing 3NF relation schemes (Q1166279) (← links)
- On the number of candidate keys (Q1252714) (← links)
- Contribution to the theory of data base relations (Q1254852) (← links)
- (Q3685241) (← links)