|
gptkb:Generalized_Sokoban
|
gptkb:NP-hard
|
|
gptkb:maximum_clique_problem
|
NP-complete
|
|
gptkb:prize-collecting_Steiner_tree_problem
|
gptkb:NP-hard
|
|
gptkb:Floyd's_algorithm_(random_selection)
|
O(k)
|
|
gptkb:18xx_series
|
high
|
|
gptkb:Soft_Heap
|
O(1) amortized insert
|
|
gptkb:Grover's_algorithm
|
O(sqrt(N))
|
|
gptkb:subset_sum_problem_(optimization_version)
|
gptkb:NP-hard
|
|
gptkb:Zwick's_algorithm
|
O(n^{2.575})
|
|
gptkb:Computation_Tree_Logic*
|
model checking is PSPACE-complete
|
|
gptkb:A*_Search
|
O(b^d)
|
|
gptkb:Levin_search
|
NP-complete
|
|
gptkb:Horner's_Method
|
O(n)
|
|
gptkb:Box_Blur
|
O(n)
|
|
gptkb:Number_Field_Sieve
|
sub-exponential
|
|
gptkb:Morphling
|
High
|
|
gptkb:K-medoids
|
higher than K-means
|
|
gptkb:Rapidly-exploring_Random_Tree
|
O(n log n)
|
|
gptkb:Max_Cut
|
NP-complete
|
|
gptkb:CYK_algorithm
|
O(n^3 * |G|)
|