Re: Sorting a list of lists in the order of ascending length

On 28 Sep 2013, at 13:18 , Uwe Lesta <[email protected]> wrote:

>> On 24 Sep 2013, at 18:39 , Norbert E. Fuchs <[email protected]> wrote:
>> 
>>> I need all subsets of a list in the order of ascending length of the
>> subsets.
> 
> <snip>
> 
>> No, since I need the subsets strictly in ascending order of length. (I
>> am working on a theorem prover and I want to find the minimal sets of
>> axioms needed to prove a theorem.)
> 
> <snip>
> 
> This sounds like a NP-Hard task. 
> If your problem size grows and you do not really need the smallest set
> consider the QuickXplain / FastXplain algorithms.

Uwe

Thanks for the hint that I will keep in mind. 

   --- nef