|
gptkb:boolean_satisfiability_problem
|
NP-complete
|
|
gptkb:sieve_of_Eratosthenes
|
O(n log log n)
|
|
gptkb:Miller–Rabin_primality_test
|
O(k log^3 n)
|
|
gptkb:Least_Recently_Used_(LRU)
|
O(n) with simple list
|
|
gptkb:Hamming_weight
|
O(n) for n-bit string
|
|
gptkb:Linear_Extension
|
Counting the number of linear extensions is #P-complete.
|
|
gptkb:AIXI
|
incomputable
|
|
gptkb:3-Dimensional_Matching
|
NP-complete
|
|
gptkb:Storer–Szymanski_algorithm
|
O(n + m log m)
|
|
gptkb:Satisfiability_problem
|
NP-complete
|
|
gptkb:Shanks's_square_forms_factorization
|
sub-exponential
|
|
gptkb:Girvan-Newman_algorithm
|
O(m^2 n)
|
|
gptkb:DBSCAN_algorithm
|
O(n^2) without spatial index
|
|
gptkb:PageRank_algorithm
|
O(N^2)
|
|
gptkb:LRU
|
O(1) with hash map and doubly linked list
|
|
gptkb:shortest_path_problem
|
varies by algorithm
|
|
gptkb:Integer_Programming
|
gptkb:NP-hard
|
|
gptkb:knapsack_problems
|
polynomial time (fractional knapsack)
|
|
gptkb:A*_Search
|
O(E)
|
|
gptkb:Sf3b1
|
SF3B complex
|