A polynomial-time algorithm is an algorithm whose running time grows at a polynomial rate relative to the size of the input, making it efficient and feasible for large inputs. These algorithms are crucial in computer science because they are considered tractable, meaning they can solve problems in a reasonable amount of time compared to exponential-time algorithms.