|
gptkb:2-coloring_problem
|
P
|
|
gptkb:Graph_coloring_problem
|
gptkb:NP-hard
|
|
gptkb:Asymmetric_TSP
|
gptkb:NP-hard
|
|
gptkb:Circuit_Value_Problem
|
P-complete
|
|
gptkb:0-1_Knapsack_Problem
|
NP-complete
|
|
gptkb:Brute_Force
|
often exponential time
|
|
gptkb:Cooley-Tukey_FFT_algorithm
|
O(N log N)
|
|
gptkb:2-SAT
|
P
|
|
gptkb:Topological_Sort
|
O(V+E)
|
|
gptkb:Stalingrad_'42
|
medium-high
|
|
gptkb:הפירמידה_של_חפרן
|
gptkb:פירמידות_גיזה
|
|
gptkb:0-1_knapsack_problem
|
NP-complete
|
|
gptkb:Chazelle's_minimum_spanning_tree_algorithm
|
O(m α(m, n))
|
|
gptkb:A*_search_algorithm
|
O(V)
|
|
gptkb:David_Singmaster's_method
|
Simple
|
|
gptkb:Toom–Cook_algorithm
|
O(n^1.465)
|
|
gptkb:Rabin–Miller_primality_test
|
O(k log^3 n)
|
|
gptkb:Barnes-Hut_algorithm
|
O(n log n)
|
|
gptkb:Ford-Fulkerson_method
|
depends on path-finding method
|
|
gptkb:Traveling_Salesman_Problem_(decision_version)
|
NP-complete
|