To which field does this belong?

Which field of mathematics would describe an algorithm to solve the
problem below? What keywords should I use to point me in the right
direction?

Problem:
I have a set of n distinct elements T = {e_1, e_2, ..., e_n}, and m
subsets of T, S_1, S2, ... S_m, that can overlap.
I need to find the minimum number of subsets whose union equals T.

Thanks,
Hari

.

Relevant Pages

  • To which field does this belong?
    ... Which field of mathematics would describe an algorithm to solve the ... What keywords should I use to point me in the right ... I need to find the minimum number of subsets whose union equals T. ...
    (comp.theory)
  • Re: Cantors diagonal proof wrong?
    ... Yes, the problem is *language*; ... The algorithm is trivial, ... >about how some important things are formally defined in mathematics. ... >hardware, whether that's computer hardware, or neural brain hardware. ...
    (sci.math)
  • Re: Symbolic computation issues
    ... Axiom is clearly not driven by sales. ... Mathematics will continue to be a fundamental and growing science. ... associated with the algebra algorithms. ... for the mathematical algorithm developer ...
    (sci.math.symbolic)
  • =?iso-8859-1?q?Re:_What_does_G=F6dels_Incompleteness_mean_for_the_Working_Mathematician=3F?=
    ... There is no reason to believe that either is the case in Peano ... alternative interpretation of Gödelian incompleteness under Church's ... algorithm computes an arithmetical relation R, ... understanding of classical mathematics as suggested by standard ...
    (sci.math)
  • Re: Natural language programming?
    ... A doctor MUST know certain things, or he is not a doctor. ... > In the same way that playing monopoly is a form of mathematics. ... The science part should be obvious. ... but the underlying algorithm to perform a task remains the same. ...
    (comp.programming)