The following pages link to (Q4638059):
Displaying 16 items.
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- On solving hard problems by polynomial-size circuits (Q1095663) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- (Q4212463) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5121902) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- The Complexity of Somewhat Approximation Resistant Predicates (Q5167783) (← links)
- A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (Q5363756) (← links)
- Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond (Q6083603) (← links)
- (Q6084394) (← links)
