From: "David S." <dgjs@...>
Date: 2001-05-27T14:10:43+09:00
Subject: [ruby-talk:15790] Re: Subsets of a set

On Sun, May 27, 2001 at 11:10:05AM +0900, Harry Ohlsen wrote:
> Harry Ohlsen wrote:
> 
> At least, that would be fine for sets of a reasonable size, since
> I actually want to
> generate them all, just grouped into sets of the various possible sizes.
> 
> For any mathematicians out there, what I'm working on is something to
> generate
> all of the discrete topologies for a given set.  Someone here recently did
> it in C++, but
> their code runs for a very long time and I'd like to see if I can write
> something neater
> in Ruby.

An alogorithm exponential in it's input size "runs for a very long time"?
Isn't that surprising ...

David S.