computational complexity theory

基本解釋

In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.
因在計(jì)算複襍性理論、應(yīng)用密碼學(xué)和程序測(cè)試方麪的貢獻(xiàn)而獲獎(jiǎng)。
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：計(jì)算複襍性理論使用大 0 符號(hào)描述輸入數(shù)據(jù)大小如何影響計(jì)算資源對(duì)算法的使用。
It absorbed some results of artificial intelligence, probability and statistics, computational complexity theory, control theory, information theory, philosophy, physiology, neurobiological.
它吸取了人工智能、概率統(tǒng)計(jì)、計(jì)算複襍性理論、控制論、信息論、哲學(xué)、生理學(xué)、神經(jīng)生物學(xué)等學(xué)科的成果。