|
gptkb:Traveling_Salesman_Problem
|
gptkb:NP-hard
|
|
gptkb:std::list
|
O(1) insertion and removal
|
|
gptkb:Ide's_algorithm
|
polynomial time
|
|
gptkb:Boolean_satisfiability_problem_(SAT)
|
NP-complete
|
|
gptkb:Facility_Location
|
gptkb:NP-hard
|
|
gptkb:अलाइ_मीनार
|
कुतुब मीनार परिसर
|
|
gptkb:Huet's_unification_algorithm
|
exponential in worst case
|
|
gptkb:Vazirani_algorithm
|
gptkb:BQP
|
|
gptkb:MATLAB_FFT
|
O(N log N)
|
|
gptkb:Schoof–Elkies–Atkin_algorithm
|
subexponential
|
|
gptkb:Kemeny-Young_method
|
gptkb:NP-hard
|
|
gptkb:Unique_Games_problem
|
NP
|
|
gptkb:Satisfiability_problem
|
NP-complete
|
|
gptkb:Multi-dimensional_Knapsack_Problem
|
gptkb:NP-hard
|
|
gptkb:Pollard's_rho_algorithm
|
O(sqrt(p))
|
|
gptkb:Directed_Feedback_Vertex_Set
|
fixed-parameter tractable
|
|
gptkb:Maximum_flow_problem
|
P
|
|
gptkb:Smith-Waterman_alignment
|
O(mn)
|
|
gptkb:Makespan_Scheduling
|
gptkb:NP-hard
|
|
gptkb:constraint_satisfaction_problem_(CSP)
|
NP-complete
|