A Dictionary of Grammatical Terms in Linguistics
/
/ n. A branch of computational mathematics which investigates the degree of difficulty of classes of problems as expressed in terms of the computational resources required to apply the most efficient algorithms available, and hence the time and space required to solve such problems on a computer.
Complexity theory is important in the construction of efficient parsers. See Barton et al. (1987).
This is the complete article, containing 64 words
(approx. 1 page at 300 words per page).
View More Summaries on Complexity theory
