|
gptkb:CVE-2023-42793
|
low
|
|
gptkb:Kruskal's_algorithm
|
O(E log E)
|
|
gptkb:Schoof–Elkies–Atkin_algorithm
|
subexponential
|
|
gptkb:Shor's_algorithm
|
polynomial time
|
|
gptkb:XOR-SAT
|
P
|
|
gptkb:Berlekamp's_algorithm
|
polynomial time
|
|
gptkb:Pollard's_p-1_algorithm
|
sub-exponential
|
|
gptkb:Computation_Tree_Logic
|
Model checking is linear in the size of the model and formula
|
|
gptkb:fractional_knapsack_problem
|
O(n log n)
|
|
gptkb:Outworld_Devourer
|
gptkb:medium
|
|
gptkb:Monotone_satisfiability
|
NP-complete
|
|
gptkb:Elliptic_curve_factorization
|
sub-exponential
|
|
gptkb:Lenstra_elliptic-curve_factorization
|
sub-exponential for small factors
|
|
gptkb:k-SAT_for_k_>_3
|
NP-complete
|
|
gptkb:Frobenius_number_problem
|
NP-hard (for general case)
|
|
gptkb:Christofides_algorithm
|
polynomial time
|
|
gptkb:K-means
|
O(nkt)
|
|
gptkb:Borůvka's_algorithm
|
O(E log V)
|
|
gptkb:KZ_reduction
|
higher than LLL reduction
|
|
gptkb:Kemeny-Young_method
|
gptkb:NP-hard
|