Determining computational complexity from characteristic ‘phase transitions’

  title={Determining computational complexity from characteristic ‘phase transitions’},
  author={R{\'e}mi Monasson and Riccardo Zecchina and Scott Kirkpatrick and Bart Selman and Lidror Troyansky},
Non-deterministic polynomial time (commonly termed ‘NP-complete’) problems are relevant to many computational tasks of practical interest—such as the ‘travelling salesman problem’—but are difficult to solve: the computing time grows exponentially with problem size in the worst case. It has recently been shown that these problems exhibit ‘phase boundaries’, across which dramatic changes occur in the computational difficulty and solution character—the problems become easier to solve away from the… CONTINUE READING
Highly Influential
This paper has highly influenced 28 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 547 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 313 extracted citations

547 Citations

Citations per Year
Semantic Scholar estimates that this publication has 547 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 30 references

the 2+p SAT case

  • R. Monasson, Zecchina, R. Tricritical points in random combinatorics
  • J. Phys. A 31, 9209±9217
  • 1998

A general upper bound for the satis®ability threshold of random K-SAT formulas

  • O. Dubois, Y. Boufkhad
  • J. Algorithms
  • 1997

Similar Papers

Loading similar papers…