computational complexity theory

基本解释

In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.
因在計算複襍性理論、應用密碼學和程序測試方麪的貢獻而獲獎。
Big-O notation: Computational complexity theory uses big-O notation to describe how input-data size affects an algorithm's use of computational resources.
Big-O notation：計算複襍性理論使用大 0 符號描述輸入數據大小如何影響計算資源對算法的使用。
It absorbed some results of artificial intelligence, probability and statistics, computational complexity theory, control theory, information theory, philosophy, physiology, neurobiological.
它吸取了人工智能、概率統計、計算複襍性理論、控制論、信息論、哲學、生理學、神經生物學等學科的成果。