Pages that link to "Item:Q4542552"

The following pages link to The approximability of NP-hard problems (Q4542552):

Displaying 32 items.

• Relation between the hardness of a problem and the number of its solutions (Q540772) (← links)
• Approximation algorithms for NP-hard problems (Q555978) (← links)
• Approximate solution of NP optimization problems (Q672315) (← links)
• NP-completeness of the Hamming salesman problem (Q761246) (← links)
• The hardness of approximation: Gap location (Q1332662) (← links)
• Interactive and probabilistic proof-checking (Q1577488) (← links)
• Rational analysis, intractability, and the prospects of `as if'-explanations (Q1709129) (← links)
• Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
• The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
• Algebraic testing and weight distributions of codes. (Q1874387) (← links)
• A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565) (← links)
• A computational-level explanation of the speed of goal inference (Q2437256) (← links)
• Hardness of fully dense problems (Q2643075) (← links)
• On the hardness of approximating \({\mathcal N}{\mathcal P}\) witnesses (Q2753732) (← links)
• On the Effective Enumerability of NP Problems (Q3499739) (← links)
• (Q3589189) (← links)
• The Fault Tolerance of NP-Hard Problems (Q3618596) (← links)
• Proof verification and hardness of approximation problems (Q4230322) (← links)
• (Q4234077) (← links)
• On the hardness of approximating minimization problems (Q4323730) (← links)
• The Complexity and Distribution of Hard Problems (Q4834381) (← links)
• (Q4864960) (← links)
• (Q4938786) (← links)
• The NP-completeness column (Q4962719) (← links)
• Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
• Some recent strong inapproximability results (Q5054856) (← links)
• Approximate counting and NP search problems (Q5055313) (← links)
• UG-hardness to NP-hardness by losing half (Q5091753) (← links)
• A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)
• The work of Subhash Khot (Q5371188) (← links)
• On Unapproximable Versions of $NP$-Complete Problems (Q5691296) (← links)
• Embracing the giant component (Q5704836) (← links)