The following pages link to (Q4864960):
Displaying 22 items.
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Completeness in approximation classes (Q811119) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Approximability of hard combinatorial optimization problems: an introduction (Q1593534) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← 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)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Logspace optimization problems and their approximability properties (Q2642909) (← links)
- Average-case non-approximability of optimisation problems (Q2642911) (← links)
- Completeness in approximation classes (Q3974859) (← links)
- Weighted NP Optimization Problems: Logical Definability and Approximation Properties (Q4210135) (← links)
- (Q4234077) (← links)
- A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)
