Testing unboundedness of database schemes and functional dependencies
The paper shows that there is a general and sufficient condition for unboundedness of database schemes and functional dependencies. It is also shown that though the condition can be tested effectively, the corresponding probability cannot be calculated in polynomial time.
scientific article; zbMATH DE number 4085078
scientific article