|
gptkb:Simplex_Method_for_Linear_Programming
|
exponential in worst case
|
|
gptkb:CVE-2023-42793
|
low
|
|
gptkb:Barnes-Hut_algorithm
|
O(n log n)
|
|
gptkb:CYK_algorithm
|
O(n^3 * |G|)
|
|
gptkb:Hartree-Fock_method
|
O(N^4)
|
|
gptkb:Boolean_satisfiability_problem
|
NP-complete
|
|
gptkb:Fast_Fourier_transform
|
O(n log n)
|
|
gptkb:Jarník–Prim_algorithm
|
O(E + V log V)
|
|
gptkb:FM_algorithm
|
O(n log n)
|
|
gptkb:Fibonacci_search_method
|
O(log n)
|
|
gptkb:Graph_coloring_problem
|
gptkb:NP-hard
|
|
gptkb:sudoku_(generalized_version)
|
NP-complete
|
|
gptkb:Ford-Fulkerson_Algorithm
|
O(max_flow * E)
|
|
gptkb:Vertex_cover
|
NP-complete
|
|
gptkb:index_calculus_algorithm
|
sub-exponential
|
|
gptkb:Tideman_method
|
polynomial time
|
|
gptkb:Rader's_FFT
|
O(n log n)
|
|
gptkb:quantum_approximate_optimization_algorithm
|
gptkb:NP-hard_problems
|
|
gptkb:Asymmetric_TSP
|
gptkb:NP-hard
|
|
gptkb:Zwick's_algorithm
|
O(n^{2.575})
|