me/toddcox-faster
1
0
Fork 0
forked from mirror/toddcox-faster
Code Pull Requests Activity
41 Commits 3 Branches 0 Tags
bdecf4034597e7672fa0cedd705847c582f69617
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
David Allemang bdecf40345 Introduce complex solvers
2021-11-12 20:36:56 -05:00
examples
Introduce complex solvers
2021-11-12 20:36:56 -05:00
ext
Use Eigen::SelfAdjointView for mults.
2021-11-01 15:59:10 -04:00
include/tc
Introduce complex solvers
2021-11-12 20:36:56 -05:00
Testing
Introduce complex solvers
2021-11-12 20:36:56 -05:00
.gitignore
Introduce complex solvers
2021-11-12 20:36:56 -05:00
.gitmodules
Use Eigen::SelfAdjointView for mults.
2021-11-01 15:59:10 -04:00
CMakeLists.txt
make 'examples' plural
2021-11-06 18:00:05 -04:00
Description
A new (basic) implementation of the Todd-Coxeter algorithm for Coxeter groups in C++ that beats GAP.
104 KiB
Languages
C++ 97.7%
CMake 2.3%