|
gptkb:Quantum_Phase_Estimation
|
gptkb:BQP
|
|
gptkb:interactive_proof_systems
|
gptkb:MA
|
|
gptkb:Undirected_Geography
|
PSPACE-complete
|
|
gptkb:boolean_satisfiability_problem_(optimization_version)
|
gptkb:NP-hard
|
|
gptkb:red-black_tree
|
O(log n) for search
|
|
gptkb:Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm
|
polynomial time
|
|
gptkb:Post_correspondence_problem_with_a_bound_on_the_number_of_tiles_used
|
NP-complete
|
|
gptkb:Roy–Floyd–Warshall_algorithm
|
O(n^3)
|
|
gptkb:std::list
|
O(1) insertion and removal
|
|
gptkb:Noughts_and_Crosses
|
Low
|
|
gptkb:Fischer–Meyer_algorithm
|
gptkb:NP-complete_problem
|
|
gptkb:SHOIN
|
NExpTime-complete
|
|
gptkb:vertex_cover_problem
|
fixed-parameter tractable (FPT) with respect to solution size
|
|
gptkb:Jarník's_algorithm
|
O(V^2) with adjacency matrix
|
|
gptkb:CVE-2014-3566
|
Low
|
|
gptkb:Ukkonen's_algorithm
|
O(n)
|
|
gptkb:K-medoids
|
higher than K-means
|
|
gptkb:Hopcroft–Karp_algorithm
|
O(√n * m)
|
|
gptkb:Semar_Temple
|
gptkb:Arjuna_Temple_Complex
|
|
gptkb:Booth's_algorithm
|
O(n)
|