Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > HARDNESS MAGNIFICATION:
Reports tagged with hardness magnification:
TR18-139 | 10th August 2018
Igor Carboni Oliveira, Rahul Santhanam

#### Hardness Magnification for Natural Problems

We show that for several natural problems of interest, complexity lower bounds that are barely non-trivial imply super-polynomial or even exponential lower bounds in strong computational models. We term this phenomenon "hardness magnification". Our examples of hardness magnification include:

1. Let MCSP\$[s]\$ be the decision problem whose YES instances are ... more >>>

TR18-158 | 11th September 2018
Igor Carboni Oliveira, Ján Pich, Rahul Santhanam

#### Hardness magnification near state-of-the-art lower bounds

Revisions: 1

This work continues the development of hardness magnification. The latter proposes a 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 problems MKtP and MCSP, where one needs ... more >>>

TR19-075 | 25th May 2019
Lijie Chen, Dylan McKay, Cody Murray, Ryan Williams

#### Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems

A frontier open problem in circuit complexity is to prove P^NP is not in SIZE[n^k] for all k; this is a necessary intermediate step towards NP is not in P/poly. Previously, for several classes containing P^NP, including NP^NP, ZPP^NP, and ... more >>>

TR19-118 | 5th September 2019
Lijie Chen, Ce Jin, Ryan Williams

#### Hardness Magnification for all Sparse NP Languages

In the Minimum Circuit Size Problem (MCSP[s(m)]), we ask if there is a circuit of size s(m) computing a given truth-table of length n = 2^m. Recently, a surprising phenomenon termed as hardness magnification by [Oliveira and Santhanam, FOCS 2018] was discovered for MCSP[s(m)] and the related problem MKtP of ... more >>>

TR19-168 | 20th November 2019
Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam

#### Beyond Natural Proofs: Hardness Magnification and Locality

Hardness magnification reduces major complexity separations (such as \$EXP \not\subseteq NC^1\$) to proving lower bounds for some natural problem \$Q\$ against weak circuit models. Several recent works [OS18, MMW19, CT19, OPS19, CMMW19, Oli19, CJW19a] have established results of this form. In the most intriguing cases, the required lower bound is ... more >>>

TR20-065 | 2nd May 2020
Lijie Chen, Ce Jin, Ryan Williams

#### Sharp Threshold Results for Computational Complexity

We establish several ``sharp threshold'' results for computational complexity. For certain tasks, we can prove a resource lower bound of \$n^c\$ for \$c \geq 1\$ (or obtain an efficient circuit-analysis algorithm for \$n^c\$ size), there is strong intuition that a similar result can be proved for larger functions of \$n\$, ... more >>>

TR22-086 | 9th June 2022
Lijie Chen, Jiatu Li, Tianqi Yang

#### Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs

Revisions: 1

In a recent work, Fan, Li, and Yang (STOC 2022) constructed a family of almost-universal hash functions such that each function in the family is computable by \$(2n + o(n))\$-gate circuits of fan-in \$2\$ over the \$B_2\$ basis. Applying this family, they established the existence of pseudorandom functions computable by ... more >>>

ISSN 1433-8092 | Imprint