Document Open Access Logo

An Algorithmic Approach to Uniform Lower Bounds

Author Rahul Santhanam

PDF
Thumbnail PDF

File

LIPIcs.CCC.2023.35.pdf
  • Filesize: 0.8 MB
  • 26 pages

Document Identifiers

Author Details

Rahul Santhanam
  • Department of Computer Science, University of Oxford, UK

Funding

This work was partly funded by the ESPRC New Horizons grant EP/V048201/1 on "Structure vs Randomness in Algorithms and Computation".

Acknowledgements

We are grateful to Eric Allender, Arkadev Chattopadhyay, Hanlin Ren, Zhenjian Lu, Igor Oliveira, Ronen Shaltiel and Srikanth Srinivasan for useful discussions.

Cite AsGet BibTex

Rahul Santhanam. An Algorithmic Approach to Uniform Lower Bounds. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 35:1-35:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.CCC.2023.35

Abstract

We propose a new family of circuit-based sampling tasks, such that non-trivial algorithmic solutions to certain tasks from this family imply frontier uniform lower bounds such as "NP is not in uniform ACC⁰" and "NP does not have uniform polynomial-size depth-two threshold circuits". Indeed, the most general versions of our sampling tasks have implications for central open problems such as NP vs P and PSPACE vs P. We argue the soundness of our approach by showing that the non-trivial algorithmic solutions we require do follow from standard cryptographic assumptions. In addition, we give evidence that a version of our approach for uniform circuits is necessary in order to separate NP from P or PSPACE from P. We give an algorithmic characterization for the PSPACE vs P question: PSPACE ≠ P iff either E has sub-exponential time non-uniform algorithms infinitely often or there are non-trivial space-efficient solutions to our sampling tasks for uniform Boolean circuits. We show how to use our framework to capture uniform versions of known non-uniform lower bounds, as well as classical uniform lower bounds such as the space hierarchy theorem and Allender’s uniform lower bound for the Permanent. We also apply our framework to prove new lower bounds: NP does not have polynomial-size uniform AC⁰ circuits with a bottom layer of MOD 6 gates, nor does it have polynomial-size uniform AC⁰ circuits with a bottom layer of threshold gates. Our proofs exploit recently defined probabilistic time-bounded variants of Kolmogorov complexity [Zhenjian Lu et al., 2022; Halley Goldberg et al., 2022; Halley Goldberg et al., 2022].

Subject Classification

ACM Subject Classification
  • Theory of computation → Circuit complexity
  • Theory of computation → Complexity classes
Keywords
  • Probabilistic Kolmogorov complexity
  • sampling algorithms
  • uniform lower bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Scott Aaronson and Avi Wigderson. Algebrization: A new barrier in complexity theory. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC '08), 2008. To appear. Google Scholar
  2. Miklos Ajtai. Σ¹₁-formulae on finite structures. Annals of Pure and Applied Logic, 24:1-48, 1983. Google Scholar
  3. Eric Allender. The permanent requires large uniform threshold circuits. Chic. J. Theor. Comput. Sci., 1999, 1999. Google Scholar
  4. Eric Allender. When worlds collide: Derandomization, lower bounds, and kolmogorov complexity. Foundations of Software Technology and Theoretical Computer Science, 21, 2001. Google Scholar
  5. Eric Allender. The new complexity landscape around circuit minimization. In Language and Automata Theory and Applications - 14th International Conference, LATA 2020, volume 12038 of Lecture Notes in Computer Science, pages 3-16. Springer, 2020. Google Scholar
  6. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, and Detlef Ronneburger. Power from random strings. SIAM Journal on Computing, 35(6):1467-1493, 2006. Google Scholar
  7. Josh Alman and Lijie Chen. Efficient construction of rigid matrices using an NP oracle. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pages 1034-1055. IEEE Computer Society, 2019. Google Scholar
  8. Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. Cryptography in nc^0. In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pages 166-175. IEEE Computer Society, 2004. Google Scholar
  9. S. Arora and B. Barak. Complexity Theory: A Modern Approach. Cambridge University Press, Cambridge, 2009. Google Scholar
  10. László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993. Google Scholar
  11. Theodore Baker, John Gill, and Robert Solovay. Relativizations of the P =? NP question. SIAM Journal on Computing, 4(4):431-442, 1975. Google Scholar
  12. David Barrington, Neil Immerman, and Howard Straubing. On uniformity within NC¹. Journal of Computer and System Sciences, 41, 1990. Google Scholar
  13. Amey Bhangale, Prahladh Harsha, Orr Paradise, and Avishay Tal. Rigid matrices from rectangular pcps or: Hard claims have complex proofs. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pages 858-869. IEEE, 2020. Google Scholar
  14. Peter Bürgisser, Christian Ikenmeyer, and Greta Panova. No occurrence obstructions in geometric complexity theory. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, pages 386-395. IEEE Computer Society, 2016. Google Scholar
  15. Lijie Chen. Non-deterministic quasi-polynomial time is average-case hard for ACC circuits. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pages 1281-1304. IEEE Computer Society, 2019. Google Scholar
  16. Lijie Chen, Xin Lyu, and R. Ryan Williams. Almost-everywhere circuit lower bounds from non-trivial derandomization. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pages 1-12. IEEE, 2020. Google Scholar
  17. Lijie Chen and Hanlin Ren. Strong average-case lower bounds from non-trivial derandomization. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 1327-1334. ACM, 2020. Google Scholar
  18. Stephen Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pages 151-158, 1971. Google Scholar
  19. Bill Fefferman, Ronen Shaltiel, Christopher Umans, and Emanuele Viola. On beating the hybrid argument. Theory Comput., 9:809-843, 2013. Google Scholar
  20. Lance Fortnow. The status of the P versus NP problem. Communications of the ACM, 52(9):78-86, 2009. Google Scholar
  21. Lance Fortnow and Adam R. Klivans. Efficient learning algorithms yield circuit lower bounds. Journal of Computer and System Sciences, 75(1):27-36, 2009. Google Scholar
  22. Merrick Furst, James Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, April 1984. Google Scholar
  23. Eran Gat and Shafi Goldwasser. Probabilistic search algorithms with unique answers and their cryptographic applications. Electron. Colloquium Comput. Complex., TR11-136, 2011. Google Scholar
  24. Halley Goldberg, Valentine Kabanets, Zhenjian Lu, and Igor Carboni Oliveira. Probabilistic kolmogorov complexity with applications to average-case complexity. In 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA, volume 234 of LIPIcs, pages 16:1-16:60. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  25. Johan Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 6-20, 1986. Google Scholar
  26. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999. Google Scholar
  27. Shuichi Hirahara. Non-black-box worst-case to average-case reductions within NP. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pages 247-258. IEEE Computer Society, 2018. Google Scholar
  28. Shuichi Hirahara. Unexpected hardness results for kolmogorov complexity under uniform reductions. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pages 1038-1051. ACM, 2020. Google Scholar
  29. Shuichi Hirahara. Average-case hardness of NP from exponential worst-case hardness assumptions. In STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing,, pages 292-302. ACM, 2021. Google Scholar
  30. Shuichi Hirahara and Rahul Santhanam. On the average-case complexity of MCSP and its variants. In Ryan O'Donnell, editor, 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, volume 79 of LIPIcs, pages 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  31. Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. Journal of Computer and System Sciences, 65(4):672-694, 2002. Google Scholar
  32. Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 220-229, 1997. Google Scholar
  33. Adam R. Klivans, Pravesh Kothari, and Igor Carboni Oliveira. Constructing hard functions using learning algorithms. In Proceedings of the 28th Conference on Computational Complexity, CCC 2013, pages 86-97. IEEE Computer Society, 2013. Google Scholar
  34. Zhenjian Lu and Igor Carboni Oliveira. Theory and applications of probabilistic kolmogorov complexity. Bull. EATCS, 137, 2022. Google Scholar
  35. Zhenjian Lu, Igor Carboni Oliveira, and Rahul Santhanam. Pseudodeterministic algorithms and the structure of probabilistic time. In STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 303-316. ACM, 2021. Google Scholar
  36. Zhenjian Lu, Igor Carboni Oliveira, and Marius Zimand. Optimal coding theorems in time-bounded kolmogorov complexity. In 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, volume 229 of LIPIcs, pages 92:1-92:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  37. Ketan Mulmuley. On p vs np and geometric complexity theory: dedicated to sri ramakrishna. Journal of the Association of Computing Machinery, 58(2), 2011. Google Scholar
  38. Ketan Mulmuley and Milind Sohoni. Geometric complexity theory I: an approach to the P vs. NP and related problems. SIAM Journal on Computing, 31(2):496-526, 2001. Google Scholar
  39. Saburo Muroga. Threshold logic and its applications. Wiley, 1971. Google Scholar
  40. Cody D. Murray and R. Ryan Williams. Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma. SIAM J. Comput., 49(5), 2020. Google Scholar
  41. Noam Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, 11(1):63-70, 1991. Google Scholar
  42. Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, 1994. Google Scholar
  43. Igor Carboni Oliveira. Randomness and intractability in kolmogorov complexity. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, volume 132 of LIPIcs, pages 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. Google Scholar
  44. Igor Carboni Oliveira and Rahul Santhanam. Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness. In 32nd Computational Complexity Conference, CCC 2017, volume 79 of LIPIcs, pages 18:1-18:49. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  45. Ian Parberry and Georg Schnitger. Parallel computation with threshold functions. J. Comput. Syst. Sci., 36(3):278-302, 1988. Google Scholar
  46. Alexander Razborov. Lower bounds for the monotone complexity of some boolean functions. Soviet Mathematics Doklady, 31:354-357, 1985. Google Scholar
  47. Alexander Razborov. Lower bounds on the size of bounded-depth networks over the complete basis with logical addition. Mathematical Notes of the Academy of Sciences of the USSR, 41(4):333-338, 1987. Google Scholar
  48. Alexander Razborov and Steven Rudich. Natural proofs. Journal of Computer and System Sciences, 55(1):24-35, 1997. Google Scholar
  49. Rahul Santhanam. Pseudorandomness and the minimum circuit size problem. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, volume 151 of LIPIcs, pages 68:1-68:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  50. Roman Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proceedings of the 19th Annual Symposium on Theory of Computing, pages 77-82, 1987. Google Scholar
  51. Richard Stearns, Juris Hartmanis, and Philip Lewis. Hierarchies of memory limited computations. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 179-190. IEEE, 1965. Google Scholar
  52. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991. Google Scholar
  53. Emanuele Viola. The complexity of distributions. SIAM J. Comput., 41(1):191-218, 2012. Google Scholar
  54. Klaus W. Wagner. The complexity of combinatorial problems with succinct input representation. Acta Informatica, 23(3):325-356, 1986. Google Scholar
  55. R. Ryan Williams. Natural proofs versus derandomization. SIAM J. Comput., 45(2):497-529, 2016. Google Scholar
  56. Richard Ryan Williams. Limits on representing boolean functions by linear combinations of simple functions: Thresholds, relus, and low-degree polynomials. In 33rd Computational Complexity Conference, CCC 2018, volume 102 of LIPIcs, pages 6:1-6:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  57. Ryan Williams. Improving exhaustive search implies superpolynomial lower bounds. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, pages 231-240, 2010. Google Scholar
  58. Ryan Williams. Non-uniform ACC circuit lower bounds. In Proceedings of 26th Annual IEEE Conference on Computational Complexity, pages 115-125, 2011. Google Scholar
  59. Ryan Williams. New algorithms and lower bounds for circuits with linear threshold gates. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 194-202, 2014. Google Scholar
  60. Andrew Chi-Chih Yao. Separating the polynomial-time hierarchy by oracles (preliminary version). In 26th Annual Symposium on Foundations of Computer Science, pages 1-10. IEEE Computer Society, 1985. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact