lev@eng.umd.edu (Lev Novik) (04/04/91)
I have a problem, for which I assume there's a classical solution, but so far I wasn't able to find one. ##PROBLEM## Suppose we have a set of elements, and a set of formulas for those elements. Formula is a pair : (subset, element), which means that given all elements in THE SUBSET, we can find THE ELEMENT. Find A smallest subset of elements, so that everything else may be derived from it using the given formulas. (Note, that we need A SMALLEST set, not a set that cannot be reduced). ########### I would appreciate any algorithm or reference to one. Thanks in advance __________________________________________________________________________ | Lev Novik \/ phone : (301) 345-2464 | | University of Maryland /\ e-mail: lev@cs.umd.edu | | College Park \/ | --------------------------------------------------------------------------