Computational Complexity of Sub-linear Convergent Algorithms.
Hilal AlQuabehFarha AlBreikiPublished in: CoRR (2022)
Keyphrases
- computational complexity
- computationally efficient
- computational cost
- orders of magnitude
- times faster
- computational efficiency
- computationally expensive
- recently developed
- high computational complexity
- theoretical analysis
- np complete
- worst case
- optimization problems
- bayesian networks
- motion estimation
- decision problems
- significant improvement
- low complexity
- memory requirements
- provably convergent