Hardness Magnification for all Sparse NP Languages
© 2019 IEEE. 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 = 2m. Recently, a surprising phenomenon termed as hardness magnification by [Oliveira and Santhanam, FOCS 2018] was discovered for MCSP[s(m)] and the rel...
Main Authors: | Chen, Lijie (Author), Jin, Ce (Author), Williams, R Ryan (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2021-11-05T14:52:13Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020) -
On Basing Private Information Retrieval on NP-Hardness
by: Liu, Tianren, et al.
Published: (2021) -
On Basing Private Information Retrieval on NP-Hardness
by: Liu, Tianren, et al.
Published: (2021) -
Tools and techniques for classifying NP-hard problems /
by: Leggett, Ernest William
Published: (1966) -
NP-Hardness of the Problem of Optimal Box Positioning
by: Alexei V. Galatenko, et al.
Published: (2019-08-01)