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.
| 2020-09-25 07:12:29 +0200 | received badge | ● Famous Question (source) |
| 2019-04-12 13:23:41 +0200 | received badge | ● Notable Question (source) |
| 2019-04-12 13:23:41 +0200 | received badge | ● Popular Question (source) |
| 2013-08-02 12:38:21 +0200 | received badge | ● Nice Question (source) |
| 2013-07-29 18:01:09 +0200 | received badge | ● Scholar (source) |
| 2013-07-29 18:01:09 +0200 | marked best answer | Find minimum value of polynomial Try the following: |
| 2013-07-29 15:50:12 +0200 | received badge | ● Editor (source) |
| 2013-07-29 14:20:42 +0200 | asked a question | Find minimum value of polynomial I have a univariate polynomial with integer coefficients over [0,1] and I would like to find a minimum value. Is there an easy way to do that in sage? |
| 2013-02-08 22:28:19 +0200 | received badge | ● Famous Question (source) |
| 2011-11-15 15:10:03 +0200 | received badge | ● Notable Question (source) |
| 2011-08-23 14:17:09 +0200 | received badge | ● Popular Question (source) |
| 2011-03-29 15:14:06 +0200 | received badge | ● Student (source) |
| 2011-03-28 21:10:14 +0200 | asked a question | Solve large system of linear equations over GF(2) I need to solve a pretty large system of linear equations over GF(2) (The matrix is around 20000 x 20000). The straightforward approach used to solve linear equation systems (by using MatrixSpace and octave) will ran out of memory before even building up the matrix. I wonder if there is any method i could use to solve such a system. Also note that the system i try to solve is sparse in general. |
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.