|
gptkb:Huffman_coding
|
O(n log n)
|
|
gptkb:Dominating_Set
|
NP-complete
|
|
gptkb:Fiduccia–Mattheyses_algorithm
|
O(|E|)
|
|
gptkb:A*_Search
|
O(b^d)
|
|
gptkb:Undirected_Geography
|
PSPACE-complete
|
|
gptkb:Multicommodity_Flow_Problem
|
NP-hard (in general)
|
|
gptkb:A*_search
|
O(b^d)
|
|
gptkb:Goertzel_algorithm
|
O(N)
|
|
gptkb:Integer_programming
|
gptkb:NP-hard
|
|
gptkb:Monotone_satisfiability
|
NP-complete
|
|
gptkb:Subgraph_Isomorphism
|
NP-complete
|
|
gptkb:Viterbi_algorithm
|
O(N^2T)
|
|
gptkb:Maximum_cut_problem
|
NP-complete
|
|
gptkb:index_calculus_algorithm
|
sub-exponential
|
|
gptkb:בניין_עיריית_ירושלים
|
gptkb:כיכר_ספרא
|
|
gptkb:Earth_mover's_distance
|
polynomial time
|
|
gptkb:Karmarkar–Karp_algorithm
|
O(n log n)
|
|
gptkb:Lucas–Lehmer_test
|
O(p^2)
|
|
gptkb:Barnes-Hut_algorithm
|
O(n log n)
|
|
gptkb:integer_partition_problem
|
#P-complete
|