## P versus NP

*Frank Vega*;

Related identifiers: , - Subject: complexity classes | completeness | one-way | reduction | polynomial time | logarithmic space

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States Nation... View more