On 23 November 2011 04:05, Bret Robideaux <[email protected]> wrote: > On Tue, Nov 22, 2011 at 10:15 AM, Richard Williamson > <[email protected]> wrote: > [snip] >> And just yesterday I found out that in doing the throw-away >> description of it, I described the factorization of relational >> hypergraph elements in a k-way partitioning (lowest cost) problem. >> >> Eh. The mind. She is tricksy.
> Wow. As geeky as I am, I still had to look that one up. Hyper what in a what? (I just woke u, getting ready for work. Mind still fuzzy). > On a brighter note, I now know where you got that HGE maneuver in > 3-dice mik ... gimme a few days, I'll have a counter for it. If you find a counter for it. let me know. rip got me with that one too. Been trying to work on one with no success. > Bret Anestis. -- Anestis Kozakis | [email protected] | http://www.akozakis.id.au/
