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...
Egile Nagusiak: | Oliveira, I, Pich, J, Santhanam, R |
---|---|
Formatua: | Conference item |
Argitaratua: |
Schloss Dagstuhl
2019
|
Antzeko izenburuak
-
Hardness magnification near state-of-the-art lower bounds
nork: Oliveira, IC, et al.
Argitaratua: (2021) -
Why are proof complexity lower bounds hard?
nork: Pich, J, et al.
Argitaratua: (2020) -
Beyond natural proofs: Hardness magnification and locality
nork: Chen, L, et al.
Argitaratua: (2020) -
Hardness magnification for natural problems
nork: Santhanam, R, et al.
Argitaratua: (2018) -
Beyond natural proofs: hardness magnification and locality
nork: Chen, Lijie, et al.
Argitaratua: (2022)