2020-12-18 13:16:37 +0100 | received badge | ● Nice Answer (source) |

2015-02-16 15:12:19 +0100 | received badge | ● Necromancer (source) |

2013-11-04 05:14:40 +0100 | received badge | ● Supporter (source) |

2011-11-10 12:36:58 +0100 | answered a question | Row echelon form of a matrix containing symbolic expresssions |

2011-10-13 14:35:59 +0100 | answered a question | Solve large system of linear equations over GF(2) Hi, 20,000 x 20,000 is not large and you should be able to do it in a few seconds on a modern CPU: However, Sage doesn't expose the fast code we have for this in M4RI:, cf. That's why it's not as fast as it should be. Sorry, we should fix this. |

2011-01-14 10:25:59 +0100 | received badge | ● Good Answer (source) |

2011-01-14 02:56:42 +0100 | received badge | ● Nice Answer (source) |

2011-01-14 01:40:40 +0100 | received badge | ● Teacher (source) |

2011-01-13 11:27:31 +0100 | answered a question | Quotient decomposition by Groebner basis Do you mean this? |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.