Skip to content
Snippets Groups Projects
Commit c9f05afb authored by Matti Pellika's avatar Matti Pellika
Browse files

Greatly improved computational complexity of reduction and coreduction,

about O(n^2) -> O(n*log(n)).

The bottleneck is now in the Smith normal form computation of the reduced
cell complexes, O(n^3).
parent 4280a4e4
No related branches found
No related tags found
No related merge requests found
Loading
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment