# Towards Hardness of Approximation for Polynomial Time Problems

> Research article (DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2017) · cited 22× · AI/ML

**Wikidata**: [openalex:W2775068415](https://www.wikidata.org/wiki/openalex:W2775068415)  
**Source**: https://4ort.xyz/entity/towards-hardness-of-approximation-for-polynomial-time-problems