P vs NP
Vega, Frank;
- Publisher: Zenodo
Related identifiers: , , - Subject: Complexity Classes | Quadratic Residue | Polynomial Time | Completeness | 3SAT
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 is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute. This q... View more