Activity
From 11 Apr 2015 to 10 May 2015
10 May 2015
-
20:02 0.10 hour (Feature #625 (Closed): NumTheory: sieve of Eratosthenes)
- Fn name
-
16:03 0.25 hour (Feature #625 (Closed): NumTheory: sieve of Eratosthenes)
- Close?
09 May 2015
08 May 2015
-
11:58 0.10 hour (Feature #215 (Closed): Janet Bases: check and include code in CoCoALib (first prototype))
- Current state?
-
11:50 2.00 hours (Bug #15 (Closed): Adjoint of a non-invertible matrix)
- Implemented first version of AdjByDetOfMinors
-
11:37 0.25 hour (Support #695 (New): Remove cruft from test files)
- Some notes
-
11:32 0.25 hour (Support #694 (Closed): In test files: when is assert.H needed?)
- Some notes
-
11:28 1.50 hour (Design #642 (Closed): Move code in test file into namespace CoCoA)
- Completed
-
11:26 0.10 hour (Feature #623 (Closed): Inverse of a matrix over ZZ)
- Example
-
09:15 2.00 hours (Support #621 (Closed): Release: CoCoALib-0.99536)
07 May 2015
-
16:57 1.00 hour (Design #642 (Closed): Move code in test file into namespace CoCoA)
- Progress
-
13:50 1.00 hour (Feature #520 (Closed): Compute inverse in quotient ring (i.e. division in algebraic extn))
30 Apr 2015
-
10:07 1.50 hour (Feature #520 (Closed): Compute inverse in quotient ring (i.e. division in algebraic extn))
-
07:38 0.25 hour (Feature #385 (In Progress): Design new errors using inheritance)
29 Apr 2015
-
19:03 3.00 hours (Feature #520 (Closed): Compute inverse in quotient ring (i.e. division in algebraic extn))
-
15:46 0.20 hour (Slug #691 (Closed): Matrix determinant over ZZ)
- Source code
-
11:33 0.10 hour (Slug #691 (Closed): Matrix determinant over ZZ)
- Reference
-
11:22 0.25 hour (Slug #691 (Closed): Matrix determinant over ZZ)
- Worse for 1000x1000
-
10:32 0.25 hour (Slug #691 (Closed): Matrix determinant over ZZ)
- Eh?!?
23 Apr 2015
-
19:12 0.50 hour (Feature #690 (New): Fault tolerant rational reconstruction: implement simultaneous version)
- Interface?
-
19:09 0.30 hour (Feature #689 (Closed): Fault tolerant rational reconstruction: make bad factor publicly accessible)
- Name?
-
19:08 0.30 hour (Feature #689 (Closed): Fault tolerant rational reconstruction: make bad factor publicly accessible)
- Nem?
22 Apr 2015
-
14:38 0.50 hour (Slug #688 (New): PolyAlgebraHom (PolyRingHom) evaluate multivariate polynomials)
-
13:53 1.00 hour (Slug #688 (New): PolyAlgebraHom (PolyRingHom) evaluate multivariate polynomials)
20 Apr 2015
-
13:21 0.25 hour (Design #686 (New): myAddMul in poly rings)
- decision of new names
-
13:20 0.25 hour (Design #686 (New): myAddMul in poly rings)
- decision of new names
-
13:20 0.25 hour (Design #686 (New): myAddMul in poly rings)
- decision of new names
-
13:17 0.10 hour (Design #686 (New): myAddMul in poly rings)
- Possible new names
-
11:59 0.50 hour (Design #686 (New): myAddMul in poly rings)
19 Apr 2015
-
18:17 0.30 hour (Feature #658 (Closed): Indets actually in a poly (or vector or matrix))
- Return value?
17 Apr 2015
-
18:32 0.25 hour (Feature #658 (Closed): Indets actually in a poly (or vector or matrix))
- Implemented first version
-
18:27 0.10 hour (Design #686 (New): myAddMul in poly rings)
-
18:25 0.50 hour (Design #686 (New): myAddMul in poly rings)
- Arg checks?
16 Apr 2015
-
12:52 0.50 hour (Feature #685 (New): Use DivMask inside QBGenerator)
- Some notes
15 Apr 2015
-
20:22 0.25 hour (Design #683 (Closed): Module index component in internal compressed representation)
- MaxExp?
-
20:15 0.10 hour (Bug #232 (New): No test for QBGenerator)
- Wake up!
14 Apr 2015
-
15:20 0.25 hour (Design #683 (Closed): Module index component in internal compressed representation)
- To do
-
13:57 0.50 hour (Design #683 (Closed): Module index component in internal compressed representation)
-
14:05 0.10 hour (Feature #658 (Closed): Indets actually in a poly (or vector or matrix))
- Further notes
-
13:59 0.25 hour (Feature #658 (Closed): Indets actually in a poly (or vector or matrix))
- Some ideas
-
11:23 0.50 hour (Feature #682 (New): PPMonoid: add fn to check for overflow in products)
- Some ideas
13 Apr 2015
-
23:31 0.50 hour (Feature #437 (In Progress): MemPool: order free blocks?)
- Needs more thought?
-
23:25 0.50 hour (Feature #681 (New): MemPool: make it easier to get just stats)
- Some ideas
-
22:22 0.30 hour (Bug #680 (Resolved): DistrMPolyClean does not use MemPool for summands?)
- MemPool should be a good choice
-
15:01 1.00 hour (Slug #679 (Closed): power for PPs is too slow)
- Implemented first version
-
14:59 1.00 hour (Slug #679 (Closed): power for PPs is too slow)
- Design
Also available in: Atom