2 00 0 Computational Complexity and Phase Transitions ( extended abstract ∗ )

@inproceedings{Istrate200,
  title={2 00 0 Computational Complexity and Phase Transitions ( extended abstract ∗ )},
  author={Gabriel Istrate}
}
Phase transitions in combinatorial problems have recently been shown [2] to be useful in locating " hard " instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been addressed in Statistical Mechanics [2] and Artificial Intelligence [3], but not studied rigorously. We take a first step in this direction by investigating the existence of sharp thresholds for the class of generalized satisfiability problems, defined by… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
13 Citations
10 References
Similar Papers

References

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

Phase transition in number partitioning problem

  • S. Mertens
  • Physical Review Letters
  • 1998

Threshold functions

  • A. Thomason.
  • Combinatorica
  • 1986

The complexity of satisfiability problems

  • T. J. Schaefer
  • Proceedings of the 13 th ACM Symposium on Theory…
  • 1978

Rényi . On the evolution of random graphs

  • A.
  • Publications of the Mathematical Institute of the…
  • 1960

The use and abuse of statistical mechanics in computational complexity

  • Y. Fu.

Similar Papers

Loading similar papers…