On Wednesday 03 October 2007, Steffen wrote:
> Ok,
>
> now I know a little bit what Sage is, at least it has its own syntax
> and can be integrated into Python. My problem is now that I need to
> implement this multivariate polynomial stuff in the NS-2 network
> simulator which is written in C++.
Ok,
now I know a little bit what Sage is, at least it has its own syntax
and can be integrated into Python. My problem is now that I need to
implement this multivariate polynomial stuff in the NS-2 network
simulator which is written in C++. The only thing that I could find is
a discussion about t
Hi,
I am the guy who asked the question in the LiDIA mailing list. Yes,
Z_q means the finite field F(p), so I will look have a look at Sage.
Cheers, Steffen
On 2 Okt., 03:26, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 10/1/07, John Cremona <[EMAIL PROTECTED]> wrote:
>
>
>
> > This came int
On 10/1/07, John Cremona <[EMAIL PROTECTED]> wrote:
>
> This came into the LiDIA mailing list (which I have been on for
> years). Would there be a positive response possible from Sage at this
> point?
>
If "Z_q" below means "GF(p)" for p a prime, then you can tell him that
Sage is faster at arit
