exponential time

RU: экспоненциальное время

A time complexity class where running time grows as c^n for some constant c > 1, most commonly O(2ⁿ). Even for n = 60, 2⁶⁰ exceeds 10¹⁸ steps, making the algorithm impractical. Brute-force subset enumeration, naive recursive Fibonacci, and some exact NP-hard solvers exhibit this growth.