|
gptkb:Johnson–Trotter_algorithm
|
O(n!)
|
|
gptkb:X3C
|
NP-complete
|
|
gptkb:Floyd's_cycle-finding_algorithm
|
O(n)
|
|
gptkb:Smith–Waterman_algorithm
|
O(mn)
|
|
gptkb:Integer_Programming
|
gptkb:NP-hard
|
|
gptkb:Hamiltonian_path
|
NP-complete
|
|
gptkb:Steinhaus–Johnson–Trotter_algorithm
|
O(n!)
|
|
gptkb:Multi-constraint_Knapsack_Problem
|
gptkb:NP-hard
|
|
gptkb:Ukkonen's_algorithm
|
O(n)
|
|
gptkb:Twilight_Struggle
|
gptkb:medium
|
|
gptkb:Jinwan_Plaza_21
|
gptkb:Jinwan_Plaza
|
|
gptkb:Hibbard's_increment
|
O(n^{3/2}) worst case for Shell sort
|
|
gptkb:Lloyd_algorithm
|
O(nkt)
|
|
gptkb:propositional_μ-calculus
|
EXPTIME-complete
|
|
gptkb:y-fast_trie
|
O(log log U)
|
|
gptkb:Minimum_cut_problem
|
polynomial time
|
|
gptkb:Lamport's_distributed_mutual_exclusion_algorithm
|
O(n)
|
|
gptkb:Atkin_sieve
|
O(n/log log n)
|
|
gptkb:Blum–Shub–Smale_machine
|
P_R
|
|
gptkb:Ko–Chao_algorithm
|
O(n^3)
|