Dear All,
I was looking into computing homology of a certain chain complex when I came
across this paper arXiv:1903.00783v1. Apparently he claims that he has an
algorithm to do so that is much faster than the one we currently have in
sage. Did I understand correctly the claim? If so, would it be worth to port
his Mathematica code? Input from someone more knowledgeable than me on
(co)homology computations would be most welcome. Thanks
S.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/20191114004758.GI11163%40bunion.