Login / Signup
Algorithm for Finding an Exact Maximum Distance in E2 with Oexp(N) Complexity: Analysis and Experimental Results.
Václav Skala
Published in:
CoRR (2022)
Keyphrases
</>
complexity analysis
maximum distance
theoretical analysis
computational complexity
learning algorithm
dynamic programming
optimal solution
worst case
data structure
lower bound
expert systems
k means
np hard
tree structure
random graphs