Well, What about trying to compile Sage with your machine in your fridge?
;-)
Otherwise, try pointing a fan on your laptop (namely the keyboard portion),
or install it on a large heat-conducting surface. Also, if your laptop is
quite old, it may have collected an impressive amount of dust in it
On Sun, Jul 14, 2013 at 12:30 PM, Emmanuel Charpentier
wrote:
> I wonder how to create an i686 executable on an amd64 machine.
>
> Rationale : I want to use sage on an an aging netbook (on which I *did*
> compile sage 5.9 successfully but quite slowly) refuses to compile sage 5.10
> : I get bizarr
I wonder how to create an i686 executable on an amd64 machine.
Rationale : I want to use sage on an an aging netbook (on which I *did*
compile sage 5.9 successfully but quite slowly) refuses to compile sage
5.10 : I get bizarre crashes : the machines does an orderly shutdown ; the
system log hi
Thanks!
I have something that is passing the tests. I thought I would be able to do
better by getting rid of the two for loops and using list comprehensions.
But, according to kernprof all I managed to do was make things worse.
def _mul_(self, y):
Hi!
On 2013-07-14, broken_symlink wrote:
> Is the code it uses for multiplication in free_algebra_element.py under
> devel/sage/sage/algebras? If so, I'm pretty sure for multiplication at
> least it should be possible to do better. Is there a way I can mess around
> with the _mul_ function eas
Is the code it uses for multiplication in free_algebra_element.py under
devel/sage/sage/algebras? If so, I'm pretty sure for multiplication at
least it should be possible to do better. Is there a way I can mess around
with the _mul_ function easily?
On Tuesday, July 9, 2013 11:46:18 PM UTC-4,
Please let me know how can i form the objective function for finding the
maximum weighted sub graph. Constraint will be highest degree of each node can
be 2.
I have the below code:
But this code will only give me maximum number of edges that can be included in
tha subgraph for the given consta
