|
gptkb:Even–Shiloach_algorithm
|
O(mn)
|
|
gptkb:0-1_Integer_Programming
|
gptkb:NP-hard
|
|
gptkb:Bluestein's_FFT
|
O(N log N)
|
|
gptkb:vertex_cover_problem
|
NP-complete
|
|
gptkb:Greedy_Method_(for_Fractional_Knapsack)
|
O(n log n)
|
|
gptkb:MATLAB_FFT
|
O(N log N)
|
|
gptkb:Lost_Ruins_of_Arnak
|
gptkb:medium
|
|
gptkb:Dijkstra's_Algorithm
|
O((V+E) log V)
|
|
gptkb:Insert_Interval
|
O(n)
|
|
gptkb:Stoer-Wagner_algorithm
|
O(n^3)
|
|
gptkb:Double_Ikat
|
very high
|
|
gptkb:Generalized_Othello
|
PSPACE-complete
|
|
gptkb:k_shortest_paths_problem
|
depends on algorithm
|
|
gptkb:Miller–Rabin_primality_test
|
O(k log^3 n)
|
|
gptkb:Exact_Cover
|
NP-complete
|
|
gptkb:Lenstra_elliptic-curve_factorization
|
sub-exponential for small factors
|
|
gptkb:Z-buffer_algorithm
|
O(n)
|
|
gptkb:Monotone_satisfiability
|
NP-complete
|
|
gptkb:Voronoi_tessellation
|
O(n log n) for n points in 2D
|
|
gptkb:Bin_Packing_Problem
|
gptkb:NP-hard
|