Path: news.easynews.com!newsfeed1.easynews.com!easynews.com!easynews!newsfeed.news2me.com!canoe.uoregon.edu!logbridge.uoregon.edu!newsfeed.stanford.edu!postnews1.google.com!not-for-mail
From: lordsofring@yahoo.com (lordsofring)
Newsgroups: comp.databases.theory
Subject: Algorithem problem
Date: 10 Nov 2002 20:16:03 -0800
Organization: http://groups.google.com/
Lines: 12
Message-ID: <598f6e78.0211102016.4e54042a@posting.google.com>
NNTP-Posting-Host: 129.97.25.73
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
X-Trace: posting.google.com 1036988163 16578 127.0.0.1 (11 Nov 2002 04:16:03 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: 11 Nov 2002 04:16:03 GMT
Xref: newsfeed1.easynews.com comp.databases.theory:23514
X-Received-Date: Sun, 10 Nov 2002 21:15:48 MST (news.easynews.com)

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