polynomial-time algorithm
[/ˌpɒlɪˈnoʊmiəl taɪm ˈælɡərɪðəm/]
nounpl: polynomial-time algorithms
algoritmo de tempo polinomial
1. A computational algorithm whose running time grows as a polynomial function of the size of the input, typically expressed as O(n^k) where n is the input size and k is a constant
Most sorting algorithms like quicksort and mergesort are polynomial-time algorithms because their time complexity is O(n log n).
A maioria dos algoritmos de ordenação, como quicksort e mergesort, são algoritmos de tempo polinomial porque sua complexidade de tempo é O(n log n).
2. In computational complexity theory, an algorithm considered efficiently solvable in practice, as opposed to exponential-time algorithms
The P versus NP problem asks whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time.
O problema P versus NP questiona se todo problema cuja solução pode ser verificada em tempo polinomial também pode ser resolvido em tempo polinomial.
This is a fundamental concept in theoretical computer science and computational complexity theory, widely taught in universities in both Brazil and the USA. The understanding of polynomial versus exponential time is crucial for computer science professionals evaluating algorithm efficiency. The term is used identically in technical contexts across both countries and globally.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →