polynomial-time solvable problem
[pɑːlɪˈnoʊmiəl taɪm ˈsɒlvəbəl ˈprɒbləm]
nounpl: polynomial-time solvable problems
problema solúvel em tempo polinomial
1. A computational problem that can be solved by a deterministic algorithm in a number of steps bounded by a polynomial function of the input size; a problem in the complexity class P (Polynomial time)
Sorting a list is a polynomial-time solvable problem because it can be completed in O(n log n) time.
Ordenar uma lista é um problema solúvel em tempo polinomial porque pode ser completado em tempo O(n log n).
2. In computational complexity theory, a decision problem for which an affirmative answer can be verified in polynomial time using a deterministic Turing machine
The problem of determining if a number is prime is a polynomial-time solvable problem.
O problema de determinar se um número é primo é um problema solúvel em tempo polinomial.
This term is fundamental to computer science and complexity theory, used globally in academic and industry contexts. It forms part of the famous P vs NP problem, one of the seven Millennium Prize Problems. The concept is essential for understanding algorithm efficiency and is taught in computer science programs worldwide, including Brazilian universities like USP, UNICAMP, and UFRJ.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →