Hardness Self-Amplification: Simplified, Optimized, and Unified
Pages 70 - 83
Abstract
Strong (resp. weak) average-case hardness refers to the properties of a computational problem in which a large (resp. small) fraction of instances are hard to solve. We develop a general framework for proving hardness self-amplification, that is, the equivalence between strong and weak average-case hardness. Using this framework, we prove hardness self-amplification for popular problems, such as matrix multiplication, online matrix-vector multiplication, triangle counting of Erdős–Rényi random graphs, and the planted clique problem. As a corollary, we obtain the first search-to-decision reduction for the planted clique problem in a high-error regime. Our framework simplifies, improves, and unifies the previous hardness self-amplification results.
Our approach uses a one-query upward self-reduction, that is, a reduction that maps a small instance to a large instance. We demonstrate that this reduction yields hardness self-amplification if the bipartite graph, whose left and right vertices correspond to small and large instances, respectively, has an expansion property. Our key technical contribution is to show the expansion property of the bipartite graph naturally constructed from the planted clique problem by using the coupling method of Markov chains.
References
[1]
Josh Alman and Virginia Vassilevska Williams. 2021. A Refined Laser Method and Faster Matrix Multiplication. In Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia, PA. 522–539. https://doi.org/10.1137/1.9781611976465.32
[2]
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, and Ning Xie. 2007. Testing k-wise and almost k-wise independence. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 496–505. isbn:9781595936318 https://doi.org/10.1145/1250790.1250863
[3]
Benny Applebaum, Boaz Barak, and Avi Wigderson. 2010. Public-key cryptography from different assumptions. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 171–180. isbn:9781450300506 https://doi.org/10.1145/1806689.1806715
[4]
Vahid R Asadi, Alexander Golovnev, Tom Gur, and Igor Shinkar. 2022. Worst-case to average-case reductions via additive combinatorics. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 1566–1574. isbn:9781450392648 https://doi.org/10.1145/3519935.3520041
[5]
Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan. 2017. Average-case fine-grained hardness. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 483–496. isbn:9781450345286 https://doi.org/10.1145/3055399.3055466
[6]
Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. 1993. Randomness in interactive proofs. Computational Complexity, 3, 4 (1993), 319–354. issn:1016-3328, 1420-8954 https://doi.org/10.1007/BF01275487
[7]
Mihir Bellare and John Rompel. 1994. Randomness-efficient oblivious sampling. In Symposium on Foundations of Computer Science (FOCS). IEEE, 276–287. https://doi.org/10.1109/SFCS.1994.365687
[8]
Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering Conjunctive Queries under Updates. In Symposium on Principles of Database Systems (PODS). Association for Computing Machinery, New York, NY, USA. 303–318. isbn:9781450341981 https://doi.org/10.1145/3034786.3034789
[9]
Quentin Berthet and Philippe Rigollet. 2013. Complexity Theoretic Lower Bounds for Sparse Principal Component Detection. In Conference on Learning Theory (COLT), Shai Shalev-Shwartz and Ingo Steinwart (Eds.). 30, PMLR, Princeton, NJ, USA. 1046–1066.
[10]
Manuel Blum, Michael Luby, and Ronitt Rubinfeld. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. System Sci., 47 (1993), 549–595. issn:00220000 https://doi.org/10.1016/0022-0000(93)90044-W
[11]
Manuel Blum and Silvio Micali. 1984. How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. Comput., 13 (1984), 850–864. issn:0097-5397 https://doi.org/10.1137/0213053
[12]
Andrej Bogdanov and Luca Trevisan. 2006. On Worst‐Case to Average‐Case Reductions for NP Problems. SIAM J. Comput., 36 (2006), 1119–1159. issn:0097-5397 https://doi.org/10.1137/S0097539705446974
[13]
Enric Boix-Adserá, Matthew Brennan, and Guy Bresler. 2021. The Average-Case Complexity of Counting Cliques in Erdős–Rényi Hypergraphs. SIAM J. Comput., FOCS19–39–FOCS19–80. issn:0097-5397 https://doi.org/10.1137/20M1316044
[14]
Matthew Brennan, Guy Bresler, and Wasim Huleihel. 2018. Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure. In Conference On Learning Theory (COLT), Sébastien Bubeck, Vianney Perchet, and Philippe Rigollet (Eds.). 75, PMLR, 48–166.
[15]
Jin-Yi Cai, Aduri Pavan, and D. Sivakumar. 1999. On the Hardness of Permanent. Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), 90–99. https://doi.org/10.1007/3-540-49116-3_8
[16]
Mu-Fa Chen. 1998. Trilogy of Couplings and General Formulas for Lower Bound of Spectral Gap. In Probability Towards 2000, L Accardi and C C Heyde (Eds.). Springer New York, New York, NY. 123–136. isbn:9781461222248 https://doi.org/10.1007/978-1-4612-2224-8_7
[17]
Mina Dalirrooyfard, Andrea Lincoln, and Virginia Vassilevska Williams. 2020. New Techniques for Proving Fine-Grained Average-Case Hardness. In Symposium on Foundations of Computer Science (FOCS). IEEE, 774–785. issn:2575-8454 https://doi.org/10.1109/FOCS46700.2020.00077
[18]
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, and Amnon Ta-Shma. 2021. List-Decoding with Double Samplers. SIAM J. Comput., 50, 2 (2021), 301–349. issn:0097-5397 https://doi.org/10.1137/19M1276650
[19]
Irit Dinur and Tali Kaufman. 2017. High Dimensional Expanders Imply Agreement Expanders. In Symposium on Foundations of Computer Science (FOCS). IEEE, 974–985. issn:0272-5428 https://doi.org/10.1109/FOCS.2017.94
[20]
Irit Dinur and Omer Reingold. 2006. Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput., 36, 4 (2006), 975–1024. issn:0097-5397 https://doi.org/10.1137/S0097539705446962
[21]
Uriel Feige and Carsten Lund. 1992. On the hardness of computing the permanent of random matrices. In Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, USA. 643–654. isbn:9780897915113 https://doi.org/10.1145/129712.129775
[22]
Rūsiņš Freivalds. 1979. Fast probabilistic algorithms. In Mathematical Foundations of Computer Science (MFCS). Springer Berlin Heidelberg, 57–69. https://doi.org/10.1007/3-540-09526-8_5
[23]
Chao Gao, Zongming Ma, and Harrison H Zhou. 2017. Sparse CCA: Adaptive Estimation and Computational Barriers. Annals of Statistics, 45, 5 (2017), 2074–2101. issn:0090-5364
[24]
Peter Gemmell and Madhu Sudan. 1992. Highly resilient correctors for polynomials. Inform. Process. Lett., 43 (1992), 169–174. issn:00200190 https://doi.org/10.1016/0020-0190(92)90195-2
[25]
Elazar Goldenberg and Karthik C. S. 2020. Hardness Amplification of Optimization Problems. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. 1:1–1:13. https://doi.org/10.4230/LIPIcs.ITCS.2020.1
[26]
Oded Goldreich. 2011. A Sample of Samplers: A Computational Perspective on Sampling. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Oded Goldreich (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 302–332. isbn:9783642226700 https://doi.org/10.1007/978-3-642-22670-0_24
[27]
Oded Goldreich. 2020. On Counting t-Cliques Mod 2. ECCC TR20-104, https://www.wisdom.weizmann.ac.il/~oded/p_cc-mod2.html
[28]
Oded Goldreich, Noam Nisan, and Avi Wigderson. 2011. On Yao’s XOR-Lemma. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 273–301. https://doi.org/10.1007/978-3-642-22670-0_23
[29]
Oded Goldreich and Guy Rothblum. 2018. Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. In Symposium on Foundations of Computer Science (FOCS). IEEE, 77–88. issn:2575-8454 https://doi.org/10.1109/FOCS.2018.00017
[30]
Oded Goldreich and Shmuel Safra. 2000. A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. SIAM J. Comput., 29, 4 (2000), 1132–1154. issn:0097-5397 https://doi.org/10.1137/S0097539797315744
[31]
Bruce Hajek, Yihong Wu, and Jiaming Xu. 2015. Computational Lower Bounds for Community Detection on Random Graphs. In Proceedings of Conference on Learning Theory (COLT), Peter Grünwald, Elad Hazan, and Satyen Kale (Eds.). 40, PMLR, Paris, France. 899–928.
[32]
Elad Hazan and Robert Krauthgamer. 2011. How Hard Is It to Approximate the Best Nash Equilibrium? SIAM J. Comput., 40, 1 (2011), 79–91. issn:0097-5397 https://doi.org/10.1137/090766991
[33]
Alexander Healy, Salil Vadhan, and Emanuele Viola. 2006. Using Nondeterminism to Amplify Hardness. SIAM J. Comput., 35 (2006), 903–931. issn:0097-5397 https://doi.org/10.1137/S0097539705447281
[34]
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 21–30. isbn:9781450335362 https://doi.org/10.1145/2746539.2746609
[35]
Monika Henzinger, Andrea Lincoln, and Barna Saha. 2022. The Complexity of Average-Case Dynamic Subgraph Counting. In Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 459–498. https://doi.org/10.1137/1.9781611977073.23
[36]
Shuichi Hirahara and Nobutaka Shimizu. 2021. Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. In Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2346–2365. https://doi.org/10.1137/1.9781611976465.140
[37]
Shuichi Hirahara and Nobutaka Shimizu. 2022. Hardness Self-Amplification from Feasible Hard-Core Sets. In Symposium on Foundations of Computer Science (FOCS). 0, IEEE, 543–554. https://doi.org/10.1109/FOCS54457.2022.00058
[38]
Shuichi Hirahara and Nobutaka Shimizu. 2023. Hardness Self-Amplification: Simplified, Optimized, and Unified. Electronic Colloquium on Computational Complexity (ECCC). issn:1433-8092
[39]
Russel Impagliazzo. 1995. Hard-core distributions for somewhat hard problems. In Symposium on Foundations of Computer Science (FOCS). IEEE, 538–545. issn:0272-5428 https://doi.org/10.1109/SFCS.1995.492584
[40]
Russell Impagliazzo, Ragesh Jaiswal, and Valentine Kabanets. 2009. Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. SIAM J. Comput., 39 (2009), 564–605. issn:0097-5397 https://doi.org/10.1137/070683994
[41]
Russell Impagliazzo, Ragesh Jaiswal, and Valentine Kabanets. 2009. Chernoff-Type Direct Product Theorems. Journal of Cryptology, 22 (2009), 75–92. issn:0933-2790 https://doi.org/10.1007/s00145-008-9029-7
[42]
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, and Avi Wigderson. 2010. Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput., 39 (2010), 1637–1665. issn:0097-5397 https://doi.org/10.1137/080734030
[43]
Russell Impagliazzo and Avi Wigderson. 1997. P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Symposium on Theory of Computing (STOC). Association for Computing Machinery, New York, NY, USA. 220–229. isbn:9780897918886 https://doi.org/10.1145/258533.258590
[44]
Mark Jerrum. 1992. Large Cliques Elude the Metropolis Process. Random Structures & Algorithms, 3, 4 (1992), 347–360. https://doi.org/10.1002/rsa.3240030402
[45]
Ari Juels and Marcus Peinado. 2000. Hiding Cliques for Cryptographic Security. Designs, Codes and Cryptography, 20, 3 (2000), 269–280. issn:0925-1022, 1573-7586 https://doi.org/10.1023/A:1008374125234
[46]
Pascal Koiran and Anastasios Zouzias. 2014. Hidden Cliques and the Certification of the Restricted Isometry Property. IEEE Transactions on Information Theory, 60, 8 (2014), 4999–5006. issn:0018-9448, 1557-9654 https://doi.org/10.1109/TIT.2014.2331341
[47]
Luděk Kučera. 1995. Expected Complexity of Graph Partitioning Problems. Discrete Applied Mathematics, 57, 2-3 (1995), 193–212. https://doi.org/10.1016/0166-218X(94)00103-K
[48]
Kasper Green Larsen, J Ian Munro, Jesper Sindahl Nielsen, and Sharma V Thankachan. 2015. On hardness of several string indexing problems. Theoretical Computer Science, 582 (2015), 74–82. issn:0304-3975 https://doi.org/10.1016/j.tcs.2015.03.026
[49]
David Levin and Yuval Peres. 2017. Markov Chains and Mixing Times (2nd ed.). American Mathematical Society. isbn:9781470429621 https://doi.org/10.1090/mbk/107
[50]
Richard Lipton. 1991. New directions in testing. Distributed Computing and Cryptography, 2 (1991), 191–202. isbn:9780821865903 https://doi.org/10.1090/dimacs/002
[51]
Zongming Ma and Yihong Wu. 2015. Computational Barriers in Minimax Submatrix Detection. Annals of Statistics, 43, 3 (2015), 1089–1116. issn:0090-5364
[52]
Pasin Manurangsi, Aviad Rubinstein, and Tselil Schramm. 2021. The Strongish Planted Clique Hypothesis and Its Consequences. In Innovations in Theoretical Computer Science Conference (ITCS), James R Lee (Ed.). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany. 10:1–10:21. https://doi.org/10.4230/LIPIcs.ITCS.2021.10
[53]
Ryan O’Donnell. 2004. Hardness amplification within NP. J. Comput. Syst. Sci., 69, 1 (2004), 68–94. https://doi.org/10.1016/j.jcss.2004.01.001
[54]
Tom Sanders. 2012. On the Bogolyubov–Ruzsa lemma. Analysis & PDE, 5 (2012), 10, 627–655. issn:1948-206X https://doi.org/10.2140/apde.2012.5.627
[55]
Ronen Shaltiel and Emanuele Viola. 2010. Hardness Amplification Proofs Require Majority. SIAM J. Comput., 39, 7 (2010), 3122–3154. https://doi.org/10.1137/080735096
[56]
Andrew C Yao. 1982. Theory and application of trapdoor functions. In Symposium on Foundations of Computer Science (SFCS). IEEE, 80–91. issn:0272-5428 https://doi.org/10.1109/SFCS.1982.45
[57]
David Zuckerman. 1997. Randomness-optimal oblivious sampling. Random Structures & Algorithms, 11, 4 (1997), 345–367. issn:1042-9832, 1098-2418 https://doi.org/10.1002/(sici)1098-2418(199712)11:4<345::aid-rsa4>3.0.co;2-z
Index Terms
- Hardness Self-Amplification: Simplified, Optimized, and Unified
Recommendations
Using nondeterminism to amplify hardness
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingWe revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC '02). We prove that if NP has a balanced function f such that any circuit of size s(n) fails to compute f on a 1/poly(n) fraction of inputs, then NP has a ...
Hardness amplification proofs require majority
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingHardness amplification is the fundamental task of converting a δ-hard function f : (0, 1)n -> (0, 1) into a (1/2-ε)-hard function Amp(f), where f is γ-hard if small circuits fail to compute f on at least a γ fraction of the inputs. Typically, ε,δ are ...
Using Nondeterminism to Amplify Hardness
We revisit the problem of hardness amplification in $\mathcal{NP}$, as recently studied by O'Donnell [ J. Comput. System Sci. , 69 (2004), pp. 68-94]. We prove that if $\mathcal{NP}$ has a balanced function $f$ such that any circuit of size $s(n)$ ...
Comments
Information & Contributors
Information
Published In
June 2023
1926 pages
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 02 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
STOC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 177Total Downloads
- Downloads (Last 12 months)71
- Downloads (Last 6 weeks)2
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
Cited By
View allView Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in