Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Where do hard problems really exist? (2309.16253v2)

Published 28 Sep 2023 in cond-mat.dis-nn, cond-mat.stat-mech, and cs.CC

Abstract: This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial challenges, emphasizing their nature. We will traverse the class P, which comprises problems solvable in polynomial time using deterministic algorithms, contrasting it with the class NP, where finding efficient solutions remains an enigmatic endeavor, understanding the intricacies of algorithmic transitions and thresholds demarcating the boundary between tractable and intractable problems. We will discuss the implications of the P versus NP problem, representing one of the profoundest unsolved enigmas of computer science and mathematics, bearing a tantalizing reward for its resolution. Drawing parallels between combinatorics and statistical physics, we will uncover intriguing interconnections that shed light on the nature of challenging problems. Statistical physics unveils profound analogies with complexities witnessed in combinatorial landscapes. Throughout this chapter, we will discuss the interplay between computational complexity theory and statistical physics. By unveiling the mysteries surrounding challenging problems, we aim to deepen understanding of the very essence of computation and its boundaries. Through this interdisciplinary approach, we aspire to illuminate the intricate tapestry of complexity underpinning the mathematical and physical facets of hard problems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (117)
  1. Spin glass theory and beyond: An Introduction to the Replica Method and Its Applications, volume 9. World Scientific Publishing Company, 1987.
  2. Richard M Karp. Reducibility among combinatorial problems. Springer, 2010.
  3. Algorithms for the satisfiability (sat) problem: A survey. Satisfiability problem: Theory and applications, 35:19–152, 1996.
  4. Claude E Shannon. Claude elwood shannon: Collected papers. IEEE press, 1993.
  5. Modern coding theory. Cambridge university press, 2008.
  6. Shang-Keng Ma. Statistical mechanics. World Scientific Publishing Company, 1985.
  7. Kerson Huang. Introduction to statistical physics. CRC press, 2009.
  8. Giorgio Parisi. Facing complexity. Physica Scripta, 35(2):123, feb 1987.
  9. Leticia F Cugliandolo. A scientific portrait of giorgio parisi: complex systems and much more. Journal of Physics: Complexity, 4(1):011001, 2023.
  10. Giorgio Parisi. Thoughts on complex systems: an interview with giorgio parisi. Journal of Physics: Complexity, 3(4):040201, 2023.
  11. Béla Bollobás. Modern graph theory, volume 184. Springer Science & Business Media, 1998.
  12. Combinatorial optimization: algorithms and complexity. Courier Corporation, 1998.
  13. Stochastic optimization. Springer Science & Business Media, 2007.
  14. Combinatorial optimization, volume 1. Springer, 2011.
  15. Merrill M Flood. The traveling-salesman problem. Operations research, 4(1):61–75, 1956.
  16. Graph coloring problems. John Wiley & Sons, 2011.
  17. Maxcut in h-free graphs. Combinatorics, Probability and Computing, 14(5-6):629–647, 2005.
  18. The maximum clique problem. Handbook of Combinatorial Optimization: Supplement Volume A, pages 1–74, 1999.
  19. Handbook of satisfiability, volume 185. IOS press, 2009.
  20. Computers and intractability. A Guide to the, 1979.
  21. Antonio Fazio. Globalization: Political economy and social doctrine. Communication Research Trends, 2009.
  22. Information, physics, and computation. Oxford University Press, 2009.
  23. Alan M Turing. Computing machinery and intelligence. Springer, 2009.
  24. Computational complexity: a modern approach. Cambridge University Press, 2009.
  25. Introduction to algorithms. MIT press, 2022.
  26. Criticality and conformality in the random dimer model. Physical Review E, 103(4):042127, 2021.
  27. Finite-size corrections in the random assignment problem. Physical Review E, 95(5):052129, 2017.
  28. Oded Goldreich. P, NP, and NP-Completeness: The basics of computational complexity. Cambridge University Press, 2010.
  29. Stephen A Cook. The complexity of theorem-proving procedures. In Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook, pages 143–152. 2023.
  30. The millennium prize problems. American Mathematical Soc., 2006.
  31. Donald E Knuth. The art of computer programming, Volume 4, Fascicle 6: Satisfiability. Addison-Wesley Professional, 2015.
  32. Repetition of the michelson-morley experiment. JOSA, 18(3):181_1–182, 1929.
  33. Ergodic observables in non-ergodic systems: the example of the harmonic chain. arXiv preprint arXiv:2307.03949, 2023.
  34. Diffusion of a brownian ellipsoid in a force field. Europhysics letters, 114(3):30005, 2016.
  35. Hard optimization problems have soft edges. Scientific Reports, 13(1):3671, 2023.
  36. Large independent sets on random d𝑑ditalic_d-regular graphs with fixed degree d𝑑ditalic_d. arXiv preprint arXiv:2003.12293, 2020.
  37. Advective-diffusive motion on large scales from small-scale dynamics with an internal symmetry. Physical Review E, 93(6):062147, 2016.
  38. Solution for a bipartite euclidean traveling-salesman problem in one dimension. Physical Review E, 97(5):052109, 2018.
  39. Selberg integrals in 1d random euclidean optimization problems. Journal of Statistical Mechanics: Theory and Experiment, 2019(6):063401, 2019.
  40. Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions. Physical Review E, 98(3):030101, 2018.
  41. Fluctuations in the random-link matching problem. Physical Review E, 100(3):032102, 2019.
  42. Two-loop corrections to large order behavior of φ𝜑\varphiitalic_φ4 theory. Nuclear Physics B, 922:293–318, 2017.
  43. Two-loop corrections to the large-order behavior of correlation functions in the one-dimensional n-vector model. Physical Review D, 101(12):125001, 2020.
  44. Correlation functions of the anharmonic oscillator: Numerical verification of two-loop corrections to the large-order behavior. Physical Review D, 105(10):105012, 2022.
  45. Chaos and correlated avalanches in excitatory neural networks with synaptic plasticity. Physical review letters, 118(9):098102, 2017.
  46. Order symmetry breaking and broad distribution of events in spiking neural networks with continuous membrane potential. Chaos, Solitons & Fractals, 147:110946, 2021.
  47. Diffusion-driven instability of topological signals coupled by the dirac operator. Physical Review E, 106(6):064314, 2022.
  48. Reconstruction scheme for excitatory and inhibitory dynamics with quenched disorder: application to zebrafish imaging. Journal of Computational Neuroscience, 49:159–174, 2021.
  49. Entropy production of a brownian ellipsoid in the overdamped limit. Physical Review E, 93(1):012132, 2016.
  50. Optimization by simulated annealing. science, 220(4598):671–680, 1983.
  51. Simulated annealing. Springer, 1987.
  52. Nonequilibrium monte carlo for unfreezing variables in hard combinatorial optimization. arXiv preprint arXiv:2111.13628, 2021.
  53. Clayton W Commander. Maximum cut problem, max-cut. Encyclopedia of Optimization, 2, 2009.
  54. Computational complexity and statistical physics. OUP USA, 2006.
  55. Alexander K Hartmann. Ground states of two-dimensional ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture. Journal of Statistical Physics, 144:519–540, 2011.
  56. Janus ii: A new generation application-driven computer for spin-system simulations. Computer Physics Communications, 185(2):550–559, 2014.
  57. Simulated annealing, optimization, searching for ground states. In Spin Glass Theory and Far Beyond: Replica Symmetry Breaking After 40 Years, pages 1–20. World Scientific, 2023.
  58. Alan Bundy. The interaction of representation and reasoning. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 469(2157):20130194, 2013.
  59. Sat based predicate abstraction for hardware verification. In Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers 6, pages 78–92. Springer, 2004.
  60. Russ B Altman. Bioinformatics in support of molecular medicine. In Proceedings of the AMIA Symposium, page 53. American Medical Informatics Association, 1998.
  61. Extending sat solvers to cryptographic problems. In International Conference on Theory and Applications of Satisfiability Testing, pages 244–257. Springer, 2009.
  62. Hiding solutions in random satisfiability problems: A statistical mechanics approach. Physical review letters, 88(18):188701, 2002.
  63. Statistical mechanics methods and phase transitions in optimization problems. Theoretical computer science, 265(1-2):3–67, 2001.
  64. The statistical mechanics of k-satisfaction. Advances in Neural Information Processing Systems, 6, 1993.
  65. Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem. Physica A: Statistical Mechanics and its Applications, 306:381–394, 2002.
  66. Statistical mechanics of the random k-satisfiability model. Physical Review E, 56(2):1357, 1997.
  67. Entropy of the k-satisfiability problem. Physical review letters, 76(21):3881, 1996.
  68. The sat phase transition. In Proceedings of the 11th European Conference on Artificial Intelligence, ECAI’94, page 105–109, USA, 1994. John Wiley & Sons, Inc.
  69. Proof of the satisfiability conjecture for large k. In Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC ’15, page 59–68, New York, NY, USA, 2015. Association for Computing Machinery.
  70. Determining computational complexity from characteristic ‘phase transitions’. Nature, 400(6740):133–137, 1999.
  71. Statistical physics of inference: Thresholds and algorithms. Advances in Physics, 65(5):453–552, 2016.
  72. Phase transitions in the coloring of random graphs. Physical Review E, 76(3):031131, 2007.
  73. Gibbs states and the set of solutions of random constraint satisfaction problems. Proceedings of the National Academy of Sciences, 104(25):10318–10323, 2007.
  74. Richard W Hamming. Error detecting and error correcting codes. The Bell system technical journal, 29(2):147–160, 1950.
  75. The cavity method at zero temperature. Journal of Statistical Physics, 111:1–34, 2003.
  76. Algorithmic barriers from phase transitions. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 793–802. IEEE, 2008.
  77. On the solution-space geometry of random constraint satisfaction problems. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 130–139, 2006.
  78. Michael Molloy. The freezing threshold for k-colourings of a random graph. Journal of the ACM (JACM), 65(2):1–62, 2018.
  79. The large deviations of the whitening process in random constraint satisfaction problems. Journal of Statistical Mechanics: Theory and Experiment, 2016(5):053401, 2016.
  80. The backtracking survey propagation algorithm for solving random k-sat problems. Nature communications, 7(1):12996, 2016.
  81. Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics. IntechOpen, 2011.
  82. Clique relaxation models in social network analysis. In Handbook of Optimization in Complex Networks: Communication and Social Networks, pages 143–162. Springer, 2011.
  83. A tutorial on clique problems in communications and signal processing. Proceedings of the IEEE, 108(4):583–608, 2020.
  84. On the evolution of random graphs. Publ. math. inst. hung. acad. sci, 5(1):17–60, 1960.
  85. Richard M Karp. The probabilistic analysis of some combinatorial search algorithms. 1976.
  86. Johan Hastad. Clique is hard to approximate within n/sup 1-/spl epsiv. In Proceedings of 37th Conference on Foundations of Computer Science, pages 627–636. IEEE, 1996.
  87. Mark Jerrum. Large cliques elude the metropolis process. Random Structures & Algorithms, 3(4):347–359, 1992.
  88. David Gamarnik. The overlap gap property: A topological barrier to optimizing over random structures. Proceedings of the National Academy of Sciences, 118(41):e2108492118, 2021.
  89. The loss surfaces of multilayer networks. In Artificial intelligence and statistics, pages 192–204. PMLR, 2015.
  90. Parallel tempering: Theory, applications, and new perspectives. Physical Chemistry Chemical Physics, 7(23):3910–3916, 2005.
  91. Stephanie Forrest. Genetic algorithms. ACM computing surveys (CSUR), 28(1):77–80, 1996.
  92. Ant colony optimization. IEEE computational intelligence magazine, 1(4):28–39, 2006.
  93. Particle swarm optimization. In Proceedings of ICNN’95-international conference on neural networks, volume 4, pages 1942–1948. IEEE, 1995.
  94. Understanding belief propagation and its generalizations. Exploring artificial intelligence in the new millennium, 8(236-239):0018–9448, 2003.
  95. Analytic and algorithmic solution of random satisfiability problems. Science, 297(5582):812–815, 2002.
  96. Survey propagation: An algorithm for satisfiability. Random Structures & Algorithms, 27(2):201–226, 2005.
  97. Algorithms for optimization. Mit Press, 2019.
  98. Message passing algorithm: A tutorial review. International Organisation of Scientific Research, 2:12–24, 2012.
  99. H-A Loeliger. An introduction to factor graphs. IEEE Signal Processing Magazine, 21(1):28–41, 2004.
  100. Giorgio Parisi. On the probabilistic approach to the random satisfiability problem. In International Conference on Theory and Applications of Satisfiability Testing, pages 203–213. Springer, 2003.
  101. A new look at survey propagation and its generalizations. Journal of the ACM (JACM), 54(4):17–es, 2007.
  102. Solving non-linear kolmogorov equations in large dimensions by using deep learning: a numerical comparison of discretization schemes. Journal of Scientific Computing, 94(1):8, 2023.
  103. Raffaele Marino. Learning from survey propagation: a neural network for max-e-3-sat. Machine Learning: Science and Technology, 2(3):035032, 2021.
  104. Unveiling the structure of wide flat minima in neural networks. Physical Review Letters, 127(27):278301, 2021.
  105. Learning through atypical phase transitions in overparameterized neural networks. Physical Review E, 106(1):014116, 2022.
  106. Deep learning via message passing algorithms based on belief propagation. Machine Learning: Science and Technology, 3(3):035005, 2022.
  107. Machine learning in spectral domain. Nature communications, 12(1):1330, 2021.
  108. Spectral pruning of fully connected layers. Scientific Reports, 12(1):11201, 2022.
  109. Training of sparse and dense deep neural networks: Fewer parameters, same performance. Physical Review E, 104(5):054312, 2021.
  110. Recurrent spectral network (rsn): Shaping a discrete map to reach automated classification. Chaos, Solitons & Fractals, 168:113128, 2023.
  111. Phase transitions in the mini-batch size for sparse and dense neural networks. arXiv preprint arXiv:2305.06435, 2023.
  112. Highly accurate protein structure prediction with alphafold. Nature, 596(7873):583–589, 2021.
  113. A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems, 32(1):4–24, 2020.
  114. David Gamarnik. Barriers for the performance of graph neural networks (gnn) in discrete random structures. a comment on [115], [116], [117]. arXiv preprint arXiv:2306.02555, 2023.
  115. Combinatorial optimization with physics-inspired graph neural networks. Nature Machine Intelligence, 4(4):367–377, 2022.
  116. Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set. Nature Machine Intelligence, 5(1):29–31, 2023.
  117. Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set. Nature Machine Intelligence, 5(1):32–34, 2023.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now