Definition: The term "refrangent" is used in the field of computer science, specifically within the context of algorithm analysis and complexity theory. It refers to a problem that can be solved efficiently using a special class of algorithms known as polynomial-time algorithms.
In computer science, an efficient algorithm is one that solves a particular computational problem in less time than another algorithm with the same computational power. Algorithms are classified into three types:
1.
Polynomial-Time Algorithms
- Algorithms that solve problems by repeatedly applying
what should be said.