computational complexity theory
Jump to navigation
Jump to search
English[edit]
Noun[edit]
computational complexity theory (countable and uncountable, plural computational complexity theories)
- (mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other.