|
Class Summary |
| Complex |
This class is an implementation for representing Complex numbers. |
| SFT |
An implementation of the SFT algorithm for finding the list of elements whose Fourier
coefficients are significant (and their coefficients) for a given function ƒ: G → C, where G is a
Cartesian product of finite groups (i.e. |
| SFTUtils |
|
| SFTUtils.DiffFunction |
Class for calculating a difference function for two given functions f1, f2 s.t. |
| SFTUtils.FullMapFunction |
class for creating a function from a given mapping of elements to their function values |
| SFTUtils.ResultFunction |
class for creating a function from the results of the SFT algorithm. |