The following pages link to (Q4407450):
Displaying 14 items.
- Approximation algorithms for NP-hard problems (Q555978) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Reducing the number of solutions of NP functions (Q1608321) (← links)
- NP-completeness of a combinator optimization problem (Q1903594) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Weighted NP Optimization Problems: Logical Definability and Approximation Properties (Q4210135) (← links)
- (Q4234077) (← links)
- (Q4864960) (← links)
- Theory and Applications of Models of Computation (Q5898889) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)