|
gptkb:Single-Source_Shortest_Path
|
depends on algorithm
|
|
gptkb:KDTree
|
O(n) for construction
|
|
gptkb:Stalingrad_'42
|
medium-high
|
|
gptkb:HashMap
|
O(1) average
|
|
gptkb:Brent's_cycle_detection_algorithm
|
O(μ + λ) time
|
|
gptkb:matching_(graph_theory)
|
finding a perfect matching is polynomial time
|
|
gptkb:FP-Growth_algorithm
|
linear with respect to number of transactions
|
|
gptkb:Hopcroft–Karp_algorithm
|
O(√n * m)
|
|
gptkb:Knuth–Morris–Pratt_algorithm
|
O(n + m)
|
|
gptkb:Exact_cover_problem
|
NP-complete
|
|
gptkb:Vuillemin's_algorithm
|
O(n)
|
|
gptkb:Hibbard's_increment
|
O(n^{3/2}) worst case for Shell sort
|
|
gptkb:quantum_Fourier_transform
|
O(n^2)
|
|
gptkb:Barvinok's_algorithm
|
polynomial time for fixed dimension
|
|
gptkb:Arthur-Merlin_games
|
gptkb:AM
|
|
gptkb:Bluestein's_FFT
|
O(N log N)
|
|
gptkb:inverse_fast_Fourier_transform_(IFFT)
|
O(N log N)
|
|
gptkb:AC-3
|
O(e d^3)
|
|
gptkb:Inverse_Fast_Fourier_Transform
|
O(N log N)
|
|
gptkb:SHOIQ
|
NExpTime-complete
|