NP-hard problem
[/ɛn-piː-hɑːrd ˈprɒbləm/]
nounpl: NP-hard problems
problema NP-difícil
1. A computational problem in complexity theory that is at least as difficult as the hardest problems in NP (nondeterministic polynomial time), meaning no known polynomial-time algorithm exists to solve it and it is unlikely one will ever be found.
The traveling salesman problem is a classic example of an NP-hard problem.
O problema do caixeiro viajante é um exemplo clássico de um problema NP-difícil.
2. A problem for which finding a solution is computationally intractable, even though verifying a proposed solution may be feasible.
Scheduling optimization is an NP-hard problem commonly encountered in logistics.
A otimização de agendamento é um problema NP-difícil comumente encontrado em logística.
This is specialized terminology primarily used in computer science, mathematics, and software engineering fields. It originated in American academic computer science in the 1970s with Stephen Cook and Richard Karp's foundational work. In Brazil and Portugal, the term is used identically in technical contexts, though it remains primarily confined to academic and professional computing communities rather than general discourse.
Related Idioms & Phrases
a computational nightmare
an intractable computational challenge
a problem without a polynomial solution
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →