|
gptkb:Faceless_Void
|
2
|
|
gptkb:Pseudo-Boolean_optimization
|
gptkb:NP-hard
|
|
gptkb:Floyd_Loop
|
O(n)
|
|
gptkb:Newton-Raphson_method
|
Depends on function and initial guess
|
|
gptkb:Preparata–Hong_convex_hull_algorithm
|
O(n log n)
|
|
gptkb:Simplex_algorithm
|
polynomial in practice
|
|
gptkb:Levin_search
|
NP-complete
|
|
gptkb:Mixed-integer_linear_programming
|
gptkb:NP-hard
|
|
gptkb:Set_Cover_Problem
|
NP-complete
|
|
gptkb:Preflow–push_algorithm
|
O(V^2 E)
|
|
gptkb:Kirkpatrick–Seidel_algorithm
|
O(n log h)
|
|
gptkb:Node_Kayles
|
PSPACE-complete
|
|
gptkb:decimation-in-frequency_FFT
|
O(N log N)
|
|
gptkb:A*_search_algorithm
|
O(E)
|
|
gptkb:הפירמידה_של_חפרן
|
gptkb:פירמידות_גיזה
|
|
gptkb:Boyer-Moore_majority_vote_algorithm
|
O(n)
|
|
gptkb:K-means_algorithm
|
O(nkt)
|
|
gptkb:MAX-CUT_problem
|
gptkb:NP-hard
|
|
gptkb:Karmarkar's_algorithm
|
polynomial time
|
|
gptkb:Independent_set_problem
|
NP-complete
|