computational complexity theory

English

Noun

computational complexity theory (countable and uncountable, plural computational complexity theories)

  1. (mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.