computational complexity theory 中文意思是什麼

computational complexity theory 解釋
計算復雜度理論
  • computational : adj. 計算的。
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  • theory : n. 1. 理論，學理，原理。2. 學說，論說 （opp. hypothesis）。3. 推測，揣度。4. 〈口語〉見解，意見。
  1. The quantum gate array is the natural quantum generalization of acyclic combinational logic " circuit " studied in conventional computational complexity theory. in 1995, barenco showed that almost any two - bit gate is universal, so building a feasible two - bit logic gate is the first step to engineer a quantum computer. in principle, the quantum bit can be carried by any two states system

    在眾多的量子計算機模型中目前討論最廣泛的是量子計算機門組網路模型，量子計算機門組網路模型是經典計算機門組網路結構的量子推廣，它是根基於barenco等人所證明的「一個兩比特受控操作和對單比特進行任意操作的門可以構成一個『通用量子邏輯門組』 」之上的。
  2. . because of overinvestment and long construction period in tall building, design staff make great efforts to give an optimization design in order to achieve the best structural layout and practise economy all the time. but on account of hugeness of design variable, constraint condition and computational complexity, the achievement of structural optimization for high rise building in engineering had droped behind the progress of theory out and away in recent years

    高層建築投資大，建設周期長，對其進行優化設計以期獲得最優結構方案並節約投資，一直是結構工程師所努力的。但是由於設計變量、約束條件、計算量過于龐大的原因，其成果還較少應用於工程實際，目前遠遠落後于理論進展。
  3. In the dissertation, two kinds of computationally efficient algorithms ( including ssca and fam ) for cyclic spectral analysises have been discussed detailly and deeply after introduce of the theory of spectral correlation, in addition, digital implementations of the corresponding algoritms architecture and the comparision of computational complexity are presented

    本文在簡要介紹了循環譜理論的基礎上，對兩種高效循環譜密度函數的計算方法（分段譜相關函數演算法（ ssca ） 、 fft累加演算法（ fam ） ）進行了詳細而深入的討論，給出了兩種演算法結構的數字實現，比較了各種方法的運算復雜度。
  4. One is combined with the maximum average error criterion and the mean square error criterion, and the other is combined with the absolute value average error criterion and the mean square error criterion. theory analysis shows that the two new search methods have less computational complexity than that of the non - optimal method

    提出了兩種替換原有均方誤差最小準測的方法，分別是最大平均誤差與均方誤差最小準則相結合的搜索標準，以及絕對值平均誤差與均方誤差最小準則相結合的搜索標準。
  5. In order to decrease the computational complexity of higher - order statistics ( hos ), novel approximate estimation theorems of the foc and the fifth order cumulants are created and proved in theory. the simulation result shows that employing the estimation theorems to optimize the calculation of higher order statistics is an effective method

    理論分析與模擬表明：按估計定理對高階統計量的計算進行優化，不僅計算量能大幅度地減小，而且保證了通過估計得到的高階累積量有抑制高斯噪聲的優越性能，這為高階統計量的工程應用創造了一條捷徑。
分享友人
分享到 Line

分享到臉書