|
gptkb:k-SAT_(for_k_≥_3,_optimization_version)
|
has known approximation algorithms
|
|
gptkb:set_packing_problem
|
hard to approximate
|
|
gptkb:clique_problem_(optimization_version)
|
hard to approximate within n^(1-ε) for any ε>0 unless P=NP
|
|
gptkb:paraxial_Helmholtz_equation
|
paraxial approximation
|
|
gptkb:clique_problem
|
hard to approximate
|
|
gptkb:AIXI_agent
|
gptkb:AIXItl
|
|
gptkb:set_cover_problem_(optimization_version)
|
logarithmic approximation ratio
|
|
gptkb:Dirac_delta_function_(in_distributional_sense)
|
sequence of functions converging to δ in distributional sense
|
|
gptkb:GELU
|
0.5x(1 + tanh(√(2/π)(x + 0.044715x³)))
|
|
gptkb:Clique_problem
|
hard to approximate
|
|
gptkb:maximum_clique_problem
|
hard to approximate
|
|
gptkb:Subset_Sum_Problem
|
pseudo-polynomial time algorithms
|
|
gptkb:probe_branes
|
neglect backreaction
|
|
gptkb:group_Steiner_tree_problem
|
logarithmic approximation algorithms exist
|
|
gptkb:Maximum_Independent_Set
|
hard to approximate within any constant factor for general graphs
|
|
gptkb:Einstein–Infeld–Hoffmann_equations
|
post-Newtonian
|
|
gptkb:vertex_cover_problem_(optimization_version)
|
2-approximation algorithm exists
|
|
gptkb:Discrete-Time_Fourier_Transform_(DTFT)
|
gptkb:Discrete_Fourier_Transform_(DFT)
|