P versus NP: el problema estrella de la matemàtica de la computació

Authors

  • Elitza Maneva

Abstract

The problem ?P versus NP? is one of the seven Millennium Prize Problems of the Clay Mathematics Institute, whose solution would be awarded one million dollars. In this article we present in an informal manner the problem and its origin, giving along the way examples of computational problems of diferent levels of hardness, some non-trivial algorithms, the definition of Turing machine ? the mathematical model of a computer ? and the concept of polynomial reduction between problems. The most advanced part of the article presents a proof of Razborov?s 1985 theorem for monotone circuits, which solves a special case of the conjecture. We also give a translation into Catalan of a letter from Gödel to Von Neumann from 1956 which was discovered in 1988 and can be considered the first written formulation of the problem ?P versus NP?.

Published

2012-07-12

How to Cite

Maneva, E. (2012). P <i>versus</i> NP: el problema estrella de la matemàtica de la computació. Butlletí De La Societat Catalana De Matemàtiques, 27(1), 39–62. Retrieved from https://revistes.iec.cat/index.php/BSCM/article/view/75930.001

Issue

Section

Articles