#9125: more examples of simplicial complexes: RP^n, CP^2, etc.
--------------------------------+-------------------------------------------
Reporter: jhpalmieri | Owner: jhpalmieri
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-4.6.1
Component: algebraic topology | Resolution:
Keywords: | Author: John Palmieri
Upstream: N/A | Reviewer: Robert Goss
Merged: | Work_issues:
--------------------------------+-------------------------------------------
Comment(by jhpalmieri):
Replying to [comment:11 jdemeyer]:
> On the same Pentium 4 system, the following test takes almost 4 seconds,
so that should also be # long time (and hence also the following tests
involving P4).
I'll do that, but are you using specific guidelines about what constitutes
"long"? On a 2-year-old iMac, it takes about 10 seconds to doctest the
whole file ("sage -t examples.py", not "sage -t -long"). That doesn't
seem excessively long to me, especially since the machine isn't new, and
it wasn't a top-of-the line machine even when it was new.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9125#comment:12>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
