We propose and implement in C++ the hashed dynamic determinants scheme.
This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores
intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm.
Faster Geometric Algorithms via Dynamic Determinant Computation.
In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454.
Be the first to post a review of HeaDDaCHe!