computational complexity theory

名词 n.

英文释义

名词 n.
  1. A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other. countable,uncountable

词形变化

0 次浏览 数据来源: Wiktionary