On Wed, Jun 24, 2009 at 1:29 PM, adam
mohamedadam.hariv...@googlemail.com wrote:
I did not know that. I tought that by the line: S = P.division_points(n_1),
I would get a non-trivial point in that case witouh having to return all the
points. Can I just chose a non-trivial random point on the
Dear John,
I was also searching for curves of cofactor one and that's what the first
part was supposed to do, I am sorry I forgot to say it in the previous
post. Anyway I will add some lines and hope that this time things will work
well. Many thanks.
Adam
On Wed, Jun 24, 2009 at 2:13 PM,
On Jun 24, 2009, at 5:11 AM, Maurizio wrote:
I totally agree, but unfortunately it seems there are not so many
people involved in the development of SAGE, focused on these topics.
This was true of many things that are now in Sage when they started
out. Rather than existing Sage developers
I have a system of 300 quadratic boolean equations in 200 variables. I
am able to find a single solution to the system using Groebner Bases
(the PolyBori implementation) in time less than 2 minutes - 1 second
for computing the Groebner Basis and 85 seconds for computing the
variety and memory
Sorry, I thought this was clear.
when you type
sage: a=x+x+1
sage: a
2*x + 1
If I understood correctly, the simplification of x+x by 2*x is done by
maxima in the background.
I f x is here much more complicated (or if the expression itself is
complicated), the simplification process can become
On Wed, Jun 24, 2009 at 6:47 PM, Nicolasnicolas.fresseng...@gmail.com wrote:
Sorry, I thought this was clear.
when you type
sage: a=x+x+1
sage: a
2*x + 1
If I understood correctly, the simplification of x+x by 2*x is done by
maxima in the background.
Just to be clear, that is
Same problem here. Windows Vista. Exact same error message.
On Jun 14, 6:16 am, William Stein wst...@gmail.com wrote:
On Sat, Jun 13, 2009 at 10:34 PM,
rcrowno...@sbcglobal.netrcrowno...@sbcglobal.net wrote:
Did you ever get a reply? This is my problem also.
Ican'treally understand the
On Jun 23, 2009, at 3:09 PM, rje wrote:
First, thanks to David and William, who have answered my questions in
the past.
I have access to NVIDIA Tesla and AMD Firestream GPGPU hardware. Are
there any existing tools which would help facilitate porting and
finely parallelizing the following
On Jun 24, 2009, at 10:05 AM, William Stein wrote:
On Wed, Jun 24, 2009 at 6:47 PM,
Nicolasnicolas.fresseng...@gmail.com wrote:
Sorry, I thought this was clear.
when you type
sage: a=x+x+1
sage: a
2*x + 1
If I understood correctly, the simplification of x+x by 2*x is
done by
