Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals.
Christopher J. HillarAbraham Martín del CampoPublished in: J. Symb. Comput. (2013)
Keyphrases
- computational cost
- learning algorithm
- database
- computational complexity
- times faster
- computationally expensive
- significant improvement
- affine transformation
- computational efficiency
- orders of magnitude
- benchmark datasets
- computationally efficient
- optimization problems
- reinforcement learning
- decision trees
- data mining
- real time