|
gptkb:PBFT_algorithm
|
O(n^2)
|
|
gptkb:Edelsbrunner-Letscher-Zomorodian_algorithm
|
cubic in the number of simplices
|
|
gptkb:LLL_algorithm
|
polynomial time
|
|
gptkb:Generalized_Circuit_Value_Problem
|
P-complete
|
|
gptkb:matching_(graph_theory)
|
finding a perfect matching is polynomial time
|
|
gptkb:Huffman_coding
|
O(n log n)
|
|
gptkb:Topological_Sort
|
O(V+E)
|
|
gptkb:Gauss–Jordan_elimination
|
O(n^3)
|
|
gptkb:Linear_Extension
|
Counting the number of linear extensions is #P-complete.
|
|
gptkb:Newton-Raphson_method
|
Depends on function and initial guess
|
|
gptkb:PageRank_(algorithm)
|
O(N log N)
|
|
gptkb:Awerbuch's_algorithm
|
O(n log n) messages
|
|
gptkb:Asymmetric_TSP
|
gptkb:NP-hard
|
|
gptkb:Bluestein's_algorithm
|
O(n log n)
|
|
gptkb:Kruskal's_algorithm
|
O(E log E)
|
|
gptkb:Shor's_algorithm
|
polynomial time
|
|
gptkb:Munro–Paterson_algorithm
|
O(n log k)
|
|
gptkb:Undirected_Hamiltonian_Path
|
NP-complete
|
|
gptkb:Robinson's_unification_algorithm
|
polynomial time
|
|
gptkb:Sollin's_algorithm
|
O(E log V)
|