P vs NP problem

[pee vərsəs en-pee ˈprɑbləm]
noun
problema P versus NP
1. A fundamental unsolved problem in computer science and mathematics concerning whether every problem whose solution can be quickly verified can also be quickly solved
The P vs NP problem is one of the seven Millennium Prize Problems with a $1 million reward.
O problema P versus NP é um dos sete Problemas do Milênio com uma recompensa de 1 milhão de dólares.
2. The question of whether the complexity classes P and NP are equivalent
Solving the P vs NP problem would revolutionize cryptography and computational theory.
Resolver o problema P versus NP revolucionaria a criptografia e a teoria computacional.
This is specialized terminology primarily used in academic, research, and technology sectors in both Brazil and the USA. The problem represents a pinnacle of unsolved mathematical challenges and carries significant cultural weight in computer science communities worldwide. It is discussed predominantly in university courses, research papers, and among software engineers and mathematicians.
Synonyms / Sinônimos
P = NP questionP-NP conjecturecomplexity class problem

Regional Variations

General Brazilian
problema P versus NP
Standard academic and technical usage in Brazilian universities and research institutions
Portugal
problema P contra NP
Alternative phrasing sometimes used in Portuguese academia
International Academic
problema P vs NP
Often abbreviated in technical literature across Portuguese-speaking countries

Related Words

computational complexityNP-completealgorithmTuring machinepolynomial timeverificationsatisfiability problem

Related Idioms & Phrases

the million-dollar question
the holy grail of computer science
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →