1) simplification method
化简法
2) reduction rule
化简法则
1.
Based on asymptotic analysis,the paper presents ten pieces of reduction rules about analysis of algorithm computational complexity,which can be suitable for analyses of sequential algorithms,and have a powerful character of maneuverability.
提出了基于渐进分析法的算法复杂度判定的十条化简法则,适用于串行算法分析,具有很强的可操作性;同时,对与算法复杂度分析所涉及的不可解问题及并行计算技术进行了讨论,并指出了今后研究的方向。
3) transduction method
变换化简法
1.
Based on the transduction method, an improved algorithm to multilevel logic optimization, which is suited for optimizing the local logic network, was described.
基于变换化简法 ,提出了一种改进的适用于局部逻辑网络优化的多级逻辑优化算法 。
4) algebraic simplification-way
代数化简法
1.
But at present complete and systematic means hasn t been formed and no fixed step to follow,it makes algebraic simplification-way full of probability.
代数化简法可化简任意逻辑函数,但目前尚未形成一套完整系统的方法,没有一个固定的步骤可遵循,具有一定的试探性。
5) figure simplifying method
图形化简法
6) Q-M Simplistic way
Q-M化简法
参考词条
补充资料：公理化方法(见公理化和形式化)
公理化方法(见公理化和形式化)
axiomatical method
gongllbuafangfa公理化方法化和形式化。(axiomatieal method)见公理
说明：补充资料仅用于学习参考，请勿用于其它任何用途。