Optimization hardness as transient chaos in an analog approach to constraint satisfaction

Nature Physics

Volumn 7, Issue 12, 2011, Pages 966-970

  Ercsey Ravasz, Mária ^a   Toroczkai, Zoltán ^a,b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; CONTINUOUS TIME SYSTEMS; DYNAMICAL SYSTEMS; HARDNESS; POLYNOMIAL APPROXIMATION;

BASINS OF ATTRACTION; BOOLEAN SATISFIABILITY; CONSTRAINT SATISFACTION; CONTINUOUS TIME DYNAMICAL SYSTEM; DENSITY THRESHOLD; ENERGY FUNCTIONS; OPTIMIZATION PROBLEMS; TRANSIENT CHAOS;

OPTIMIZATION;

EID: 85027947126     PISSN: 17452473     EISSN: 17452481     Source Type: Journal    
DOI: 10.1038/NPHYS2105     Document Type: Article

References (30)

1. Cook, S. in Proc. Third Ann. Symp. Theory of Computing 151-158 (ACM, 1971).
2. Fortnow, L. The status of the P versus NP problem. Commun. ACM 52, 78-86 (2009).
3. Garey, M. R. & Johnson, D. S. Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman, 1990).
4. Kadanoff, L. P. & Tang, C. Escape from strange repellers. Proc. Natl Acad. Sci. 81, 1276-1279 (1984).
5. Tél, T. & Lai, Y-C. Chaotic transients in spatially extended systems. Phys. Rep. 460, 245-275 (2008).
6. Lai, Y-C. & Tél, T. Transient Chaos: Complex Dynamics on Finite-Time Scales (Springer, 2011).
7. Ott, E. Chaos in Dynamical Systems 2nd edn (Cambridge Univ. Press, 2002).
8. Nusse, H. E. & Yorke, J. A. Basins of attraction. Science 271, 1376-1380 (1996).
9. Grebogi, C., Ott, E. & Yorke, J. A. Basin boundary metamorphoses: Changes in accessible boundary orbits. Physica D 24, 243-262 (1987).
10. Elser, V., Rankenburg, I. & Thibault, P. Searching with iterated maps. Proc. Natl Acad. Sci. 104, 418-423 (2007).
11. Achlioptas, D. & Ricci-Tersenghi, F. Random formulas have frozen variables. SIAM J. Comput. 39, 260-280 (2009).
12. Zdeborová, L. & Mézard, M. Locked constraint satisfaction problems. Phys. Rev. Lett. 101, 078702 (2008).
13. Cvitanov, P., Artuso, R., Mainieri, R., Tanner, G. & Vattay, G. Chaos: Classical and Quantum (Niels Bohr Institute, 2010) ChaosBook.org/version13.
14. Branicky, M. IEEE Workshop on Physics and Computation 265-274 (IEEE Computer Society Press, 1994).
15. Siegelmann, H. T. Computation beyond the Turing limit. Science 268, 545-548 (1995).
16. Moore, C. Recursion theory on the reals and continuous-time computation. Theor. Comput. Sci. 162, 23-44 (1996).
17. Liu, S-C., Kramer, J., Indiveri, G., Delbruck, T. & Douglas, R. Analog VLSI: Circuits and Principles (MIT Press, 2002).
18. Chua, L. O. & Roska, T. Cellular Neural Networks and Visual Computing: Foundations and Applications (Cambridge Univ. Press, 2005).
19. Gu, J., Gu, Q. & Du, D. On optimizing the satisfiability (SAT) problem. J. Comput. Sci. Technol. 14, 1-17 (1999).
20. Nagamatu, M. & Yanaru, T. On the stability of Lagrange programming networks for satisfiability problems of propositional calculus. Neurocomputing 13, 119-133 (1996).
21. Wah, B. W. & Chang, Y-J. Trace-based methods for solving nonlinear global optimization and satisfiability problems. J. Glob. Opt. 10, 107-141 (1997).
22. Achlioptas, D., Coja-Oghlan, A. & Ricci-Tersenghi, F. On the solution-space geometry of constraint satisfaction problems. Random Struct. Algorithms 38, 251-268 (2011).
23. Molloy, M. Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27, 124-135 (2005).
24. Mézard, M., Ricci-Tersenghi, F. & Zecchina, R. Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys. 111, 505-533 (2003).
25. Mézard, M., Parisi, G. & Zecchina, R. Analytic and algorithmic solution of random satisfiability problems. Science 297, 812-815 (2002).
26. Achlioptas, D., Naor, A. & Peres, Y. Rigorous location of phase transitions in hard optimization problems. Nature 435, 759-764 (2005).
27. Mertens, S., Mézard, M. & Zecchina, R. Threshold values of random k-SAT from the cavity method. Random Struct. Algorithms 28, 340-373 (2006).
28. Parisi, G. Some remarks on the survey decimation algorithm for k-satisfiability. http://arxiv.org/abs/cs/0301015 (2003).
29. Seitz, S., Alava, M. & Orponen, P. Focused local search for random 3-satisfiability. J. Stat. Mech. P06006 (2005).
30. Hof, B., de Lozar, A., Kuik, D.J. & Westerweel, J. Repeller or Attractor? Selecting the dynamical model for the onset of turbulence in pipe flow. Phys. Rev. Lett. 101, 214501 (2008).