Initial commit
Snapshot

Python and C++ implementation of phi_n/lambda_n, find_lambda version 1
Optimize Matrix and add benchmarking for different implementations
Make K a template argument as well

This makes Matrix multiplications about 50% faster, as the compiler
can optimize for K as well.
Add in place multiplication benchmark
Snapshot

Pretty fast already, working on get_minimal_exponent.
Reduce lambda candidates rapidly

Always built on the already calculated best lambda.
snapshot
Much faster lambda detection, not requiring all divisors
Latest speed ups
Much faster minimal exponent finding
Use struct instead of tuple
Use Python3, add map analysis
Mapping analysis, optimizations
Add NonsingularIterator

This allows a decent speed-up in jumping non-singular matrices.
Ignoring permutations yields a huge speed-up factor of N!.
Introduce RandomIterator and MatrixIterator as base class
snapshot
latest
CRTP approach to matrix iterator

doesn't seem to be faster at all
Slight speed up by avoiding a lot of modulo

doesn't seem to be faster at all