Skip to main content

Thermodynamics of Physical Approximations to Non Deterministic Polynomial Complete Problems

Abstract

Non deterministic polynomial complete problems are playing an essential role in nowadays communications, security and many other fields. One of the well-known NP-complete problems is the Examination Timetabling problem. Given the information about the courses and the students that have taken some of those courses as well as the time slots for the exams of those courses the problem asks if there is a timetable such that no student has two exams simultaneously. We are modeling this NP-complete problem as a system of particles with one dimensional motion. After adding some interactions between the particles based on the problem we are simulating the motion and arriving to an equilibrium. We then use the equilibrium state to group the particles together where each cluster represents a time slot. To discuss the physics of this model we use the Replica method to find the free energy functional of this system. A hypothesis is formulated that all or at least most numerical solutions for NP-complete problems can be brought to this model with some configuration of interactions between the particles.

This is a preview of subscription content, access via your institution.

Fig. 1.

REFERENCES

  1. Bahi, J., Bienia, W., Cote, N., and Guyeux, C., J. Bioinform. Comput. Biol., 2014, vol. 12, p. 135.

    Google Scholar 

  2. Aaronson, S., SIGACT News, 2005, vol. 36, p. 30.

    Article  Google Scholar 

  3. Thompson, J.M. and Dowsland, K.A., Ann. Oper. Res., 1996, vol. 63, p. 105.

    Article  Google Scholar 

  4. Garey, M.R. and Johnson, D.S., Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., 1990.

    MATH  Google Scholar 

  5. Schaerf, A., Artif. Intell. Rev., 1999, vol. 13, p. 87.

    Article  Google Scholar 

  6. McCollum, B., Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling VI. PATAT'06, Springer-Verlag, Berlin, Heidelberg, p. 373, 2006.

  7. Qu, R., Burke, E., McCollum, B., Merlot, L., and Lee, S., J. Schedul., 2009, vol. 12, p. 55.

    Article  Google Scholar 

  8. Carter, M.W., Laporte, G., and Lee, S.Y., J. Oper. Res. Soc., 1996, vol. 47, p. 373.

    Article  Google Scholar 

  9. Merlot, L.T.G., Boland, N., Hughes, B.D., and Stuckey, P.J., Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference, Springer Lecture Notes in Computer Science, p. 2740, 2003.

  10. Ulker, Z., Ozcan, E., and Korkmaz, E., Practice and Theory of Automated Timetabling. Selected Papers from the 6th International Conference, Springer Lecture Notes in Computer Science, p. 3867, 2006.

  11. Dowsland, K. and Thompson, J., J. Oper. Res. Soc., 2005, vol. 56, p. 426.

    Article  Google Scholar 

  12. Gevorkyan, A.S. and Sahakyan, V.V., J. Contemp. Phys., 2020, vol. 55, p. 265.

    Article  Google Scholar 

  13. Binder, K. and Young, A.P., Rev. Mod. Phys., 1986, vol. 58, p. 801.

    ADS  Article  Google Scholar 

  14. Mezard, M., Parisi, G., and Virasoro, M., Spin Glass Theory and Beyond, World Scientific, 1986.

    MATH  Book  Google Scholar 

  15. Gutin, A.M., Grosberg, A.Y., and Shakhnovich, E.I., J. Phys. A: Math. Gen., 1993, vol. 26, p. 1037.

    ADS  Article  Google Scholar 

  16. Mamasakhlisov, Y.Sh., Bellucci, S., Hayryan, S., Caturyan, H., Grigoryan, Z., and Hu, C.-K., Eur. Phys. J. E., 2015, vol. 38, p. 100.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Stepanyan.

Ethics declarations

The authors declare no conflict of interest.

Additional information

Translated by V.A. Stepanyan

About this article

Verify currency and authenticity via CrossMark

Cite this article

Stepanyan, V.A., Khachatryan, S.G. & Hovhannisyan, S.A. Thermodynamics of Physical Approximations to Non Deterministic Polynomial Complete Problems. J. Contemp. Phys. 57, 36–40 (2022). https://doi.org/10.3103/S1068337222010145

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1068337222010145

Keywords:

  • NP-complete
  • Replica model
  • mean field approximation
  • physics inspired computing
  • heuristics
  • free energy