poly-time algorithm
[ˈpɒli taɪm ˈælɡərɪðəm]
nounpl: poly-time algorithms
algoritmo de tempo polinomial
1. An algorithm whose time complexity is bounded by a polynomial function of the input size, meaning the running time grows at most polynomially with the input size
The quicksort algorithm is a poly-time algorithm with O(n log n) average-case complexity.
O algoritmo quicksort é um algoritmo de tempo polinomial com complexidade média O(n log n).
2. In computational complexity theory, an algorithm that can be solved by a deterministic Turing machine in polynomial time, classified as belonging to the P complexity class
Finding the greatest common divisor using the Euclidean algorithm is a classic example of a poly-time algorithm.
Encontrar o máximo divisor comum usando o algoritmo euclidiano é um exemplo clássico de algoritmo de tempo polinomial.
This is specialized technical terminology used predominantly in computer science, mathematics, and theoretical computer science communities. It is used identically in both Brazilian Portuguese and Portuguese academic settings. The abbreviation 'poly-time' is common in informal technical discussions and research papers in English-speaking countries, while Portuguese speakers typically use the full term 'tempo polinomial' in formal contexts.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →