|
gptkb:Chinese_postman_problem
|
NP-hard (for mixed graphs)
|
|
gptkb:Morphling
|
High
|
|
gptkb:Ardennes_'44
|
medium-high
|
|
gptkb:meet-in-the-middle_algorithm
|
O(2^{n/2})
|
|
gptkb:Gauss-Jordan_elimination
|
O(n^3)
|
|
gptkb:Dinitz_blocking_flow_algorithm
|
O(V^2 E)
|
|
gptkb:Lipton–Tarjan_planarity_algorithm
|
linear time
|
|
gptkb:Arc_Consistency_Algorithm_3
|
O(e*d^3)
|
|
gptkb:Dijkstra's_Algorithm
|
O(V^2)
|
|
gptkb:Jinwan_Plaza_49
|
gptkb:Jinwan_Plaza
|
|
gptkb:Myers_diff_algorithm
|
O(ND)
|
|
gptkb:Maximum_Satisfiability_Problem
|
gptkb:NP-hard
|
|
gptkb:Rader's_algorithm_for_fast_Fourier_transform
|
O(n log n)
|
|
gptkb:Lenstra–Lenstra–Lovász
|
polynomial time
|
|
gptkb:Linear_Extension
|
Counting the number of linear extensions is #P-complete.
|
|
gptkb:binary_knapsack_problem
|
exponential time (brute force)
|
|
gptkb:Tic_Tac_Toe
|
solved game
|
|
gptkb:Stoer-Wagner_algorithm
|
O(n^3)
|
|
gptkb:Stockmeyer_algorithm
|
polynomial time
|
|
gptkb:Lucas–Lehmer_Primality_Test
|
O(p^2)
|