|
gptkb:Bilateral_filtering
|
High
|
|
gptkb:Tonelli–Shanks_algorithm
|
O(log^2 p)
|
|
gptkb:Inverse_Quantum_Fourier_transform
|
O(n^2) quantum gates
|
|
gptkb:Pegasos
|
O(1/λ)
|
|
gptkb:Ford-Fulkerson_algorithm
|
O(max_flow * E)
|
|
gptkb:Baum-Welch_Algorithm
|
O(N^2T)
|
|
gptkb:Edmonds–Karp_algorithm
|
O(VE^2)
|
|
gptkb:Floyd–Warshall_algorithm
|
O(n^3)
|
|
gptkb:K-means++
|
O(k n)
|
|
gptkb:alternating_Turing_machines
|
gptkb:AL
|
|
gptkb:Todd–Coxeter_algorithm
|
can be exponential
|
|
gptkb:Crochemore–Perrin_algorithm
|
O(n)
|
|
gptkb:Traveling_Salesman_Problem_(optimization_version)
|
gptkb:NP-hard
|
|
gptkb:Fibonacci_search_method
|
O(log n)
|
|
gptkb:Ukkonen's_algorithm
|
O(n)
|
|
gptkb:Thomas_algorithm
|
O(n)
|
|
gptkb:Miller–Rabin_primality_test
|
O(k log^3 n)
|
|
gptkb:Hadlock's_algorithm
|
O(n)
|
|
gptkb:3-partition_problem
|
NP-complete
|
|
gptkb:Min-Label_Cover
|
gptkb:NP-hard
|