| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Algorithem problem
I have a question of algorithm on function dependancies.
Let A and B be two sets of function dependencies. Provide a effiecent (polymomial-time) algorithm to check if A and B are equivalent.
Prompt answere is highly appriciated.
THX Received on Sun Nov 10 2002 - 22:16:03 CST
![]() |
![]() |