Aha! Quite the challenge is it not?
On Sun, Apr 19, 2009 at 7:44 AM, Maurizio wrote:
>
> Hi all
>
> > Well, we just need a resultant algorithm that doesn't go through
> > Singular. I'm planning to write such a thing as part of my
> > cylindrical algebraic decomposition implementation sometime in
Yep, that's me!
On Sun, Apr 19, 2009 at 7:59 AM, Mike Cripps wrote:
>
> Hi all,
>
> I have been attempting to install Sage today from the source, and when
> I ran `make` I got the following output (after a lot of stuff compiled
> fine):
>
> /bin/sh ../libtool --mode=compile gcc -DHAVE_CONFIG_H
My question is how do prime numbers play into ground level computational
programming? What is a "troll" and what is a "couch boy"? Why is there is so
much resistance from the community at large against establishment of
computational complexity, specifically the claim that [P=NP] seems to be a
parti
