Hardness magnification near state-of-the-art lower bounds
This work continues the development of hardness magnification. The latter proposes a new strategy for showing strong complexity lower bounds by reducing them to a refined analysis of weaker models, where combinatorial techniques might be successful. We consider gap versions of the meta-computational...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
Schloss Dagstuhl
2019
|