This paper investigates the complexity of decision problem: for propositional CNF formulas H and F, does there exist a variable (or literal) renaming such that (H)=F? Both MAX(1) and MARG(1) are .
考虑判定问题“对于给定的CNF公式H和F是否存在一个变元(或文字)改名,使得(H)=F?”的计算复杂性。
its complexity is O(nlog2n),Fanally, numerical examples show the effectiveness of this algorithm.
借助快速付立叶变换(FFT),本文给出一种求n阶鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性。
its complexity is O(nlog_2n),Fanally,numerical examples show the effectiveness of this algorithm.
借助快速傅立叶变换(FFT),给出一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性。
An infeasible-interior-point algorithm for a class of complementary problems and its computational complexity;
求解一类互补问题的不可行内点法及其计算复杂性
The computational complexity for F′2|m 1=1, m 2=2|C max of this model is studied.
研究了装配式流水作业排序问题的一个新模型 ,并对该模型相应的排序问题的计算复杂性进行了探讨 ,且证明了其在优化指标为作业排序长度的条件下该问题是NP 完全问题 ,没有多项式时间算法。
This paper explores into the computational complexity of scheduling problem in assembly flow shop.
探讨装配式作业排序问题的计算复杂性，证明了在优化指标为作业排序长度的条件下该问题是ＮＰ－完全问题。
The algorithm needn t calculate the eigenvalues of the r-circulant matrices, and the computation time complexity of the algorithm is O(nlog_2n) by using FFT.
若用FFT计算,其计算复杂性为O(nlog2n)。
Their computation time complexity are O(mn log 2 mn ).
利用快速傅里叶变换 (FFT)技术 ,给出了计算 (m ,n)型二重 (R ,r) 循环矩阵的全部特征值和两个(m ,n)型二重 (R ,r) 循环矩阵相乘的快速算法 ,证明了它们的计算复杂性均为O(mnlog2 mn
New concepts of elementary r-circulant matrices and their some propertiesare given, It is also proved that the computation time complexity of some related algorithnisis O(log_2n)by using FFT, where n is order number of a matrix.
给出了初等Υ－循环矩阵的新概念，并研究了它们的性质，还利用ＦＦＴ（快速富里叶变换）证明了有并算法的计算复杂性为Ｏ（ｎｌｏｇ＿２ｎ）这里ｎ为矩阵的阶数。
Quantum Complexity,Quantum Computation And Its Philosophical Implications;
计算复杂性、量子计算及其哲学意义
Fat Computational Complexity and Heuristic Design for the TSP
TSP问题的脂肪计算复杂性与启发式算法设计
Algorithm Design and Computation Complexity Analysis for Control Lie Algebra
控制李代数的算法设计和计算复杂性分析
This is in increasing order of computation complexity.
这也是在增加计算复杂性的顺序。
The computational complexity of this problem is open.
这个问题的计算复杂性还没有解决.
Study of information theory and computing complexity in cryptology
密码学中信息论及计算复杂性的研究
The Computational Complexity and Approximation Algorithm for Muti-product Facility Location Problem;
多产品选址问题的计算复杂性与近似算法
Computational Complexity Analysis on Improved Py Distinguish Attack Algorithm
改进Py区分攻击算法的计算复杂性分析
Solutions to the Calculational Complexity of Convex Problem by Reduction Theory
用归约原理求解凸壳问题的计算复杂性的研究
Bidding Strategies for VCG Mechanism with Computational Complexity;
具有计算复杂性的VCG机制投标策略研究
The concrete step and complexity of the attack algorithm is given.
给出了应用该算法的具体步骤,并分析了攻击算法的计算复杂性。
A Study of the Algorithm and Computational Complexity for a Type of TMF Scheduling Problem;
一类分装式排序问题的计算方法和计算复杂性研究
Computer Simulation of Complex System--The modelling methodology for exploring of complexity;
复杂系统的计算机模拟——探索复杂性的模型方法
Matin D. Davis, Computability, Complexity, and Languages, Academic Press, 1983.
《可计算性、复杂性和语言》,清华大学出版社，北京，1989。
The initially searches on complex competition character based on the computer network system
基于计算机网络系统复杂性的竞争特性初探
Complex Instruction Set Computer
复杂指令集计算机(
Computer-Assisted Verification of Behavior Complexity of Dynamical Systems;
系统动力学行为复杂性的计算机辅助判定
Fatty Liver Diagnosis of B-mode Ultrasonography Based on the Complexity Analysis;
基于复杂性分析的脂肪肝计算机辅助诊断