Algorithms for Finite Near-rings and their N-groups.
Franz BinderPeter MayrPublished in: J. Symb. Comput. (2001)
Keyphrases
- computationally efficient
- orders of magnitude
- recently developed
- data structure
- databases
- optimization problems
- computational cost
- significant improvement
- learning algorithm
- case study
- search algorithm
- website
- information systems
- theoretical analysis
- neural network
- computer vision algorithms
- convergence rate
- real time
- combinatorial optimization
- times faster
- computationally expensive
- graphical models
- artificial intelligence
- upper bound
- computational complexity
- decision trees