|
gptkb:Nash_Equilibria
|
PPAD-complete
|
|
gptkb:Fiduccia–Mattheyses_algorithm
|
O(|E|)
|
|
gptkb:Max-SAT
|
gptkb:NP-hard
|
|
gptkb:Toom-3
|
O(n^1.465)
|
|
gptkb:Longest_path_problem
|
gptkb:NP-hard
|
|
gptkb:clique_problem
|
W[1]-complete
|
|
gptkb:PageRank
|
O(N^2)
|
|
gptkb:NP-completeness
|
NP
|
|
gptkb:Smith-Waterman_alignment
|
O(mn)
|
|
gptkb:Graham_scan
|
O(n log n)
|
|
gptkb:Ford-Fulkerson_algorithm
|
O(max_flow * E)
|
|
gptkb:Cooley-Tukey_FFT
|
O(N log N)
|
|
gptkb:Rader's_FFT
|
O(n log n)
|
|
gptkb:Dijkstra_algorithm
|
O(V^2) with simple array
|
|
gptkb:group_Steiner_tree_problem
|
gptkb:NP-hard
|
|
gptkb:Post_correspondence_problem_with_a_bound_on_the_number_of_tiles_used
|
NP-complete
|
|
gptkb:The_quadratic_sieve_factoring_algorithm
|
sub-exponential
|
|
gptkb:Chinese_postman_problem
|
NP-hard (for mixed graphs)
|
|
gptkb:Parc.1_Tower
|
gptkb:Parc.1
|
|
gptkb:Bin_Packing_Problem
|
gptkb:NP-hard
|