exponential time algorithm
[/ˌɛkspəˈnɛnʃəl taɪm ˈælɡərɪðəm/]
nounpl: exponential time algorithms
algoritmo de tempo exponencial
1. A computational algorithm whose running time grows exponentially with the size of the input, typically expressed as O(2^n) or O(c^n) where n is the input size and c is a constant greater than 1
A brute force solution to the traveling salesman problem is an exponential time algorithm because it must check all possible routes.
Uma solução por força bruta para o problema do caixeiro viajante é um algoritmo de tempo exponencial porque deve verificar todas as rotas possíveis.
2. An algorithm that becomes computationally infeasible for large inputs due to the rapid increase in execution time
Most NP-complete problems require exponential time algorithms to solve optimally without approximation.
A maioria dos problemas NP-completos requer algoritmos de tempo exponencial para resolver otimamente sem aproximação.
This is a specialized technical term used consistently across Brazilian and Portuguese academic and professional computer science communities. Understanding exponential time algorithms is fundamental to computer science education and algorithm design courses. The term is rarely used outside technical contexts and represents a critical concept in computational complexity theory and practical software development.
Related Idioms & Phrases
hit an exponential wall (encounter infeasibility with exponential algorithms)
blow up exponentially (describe how computation time increases with input)
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →