想当年一个通宵就从对计算复杂性理论一窍不通到弄懂怎么用多项式化简(polynomial reduction)证明NPC,并做完一堆证明题。想当年读书总是兴致盎然,从来不需要停下来一边向后翻页一边嘀咕怎么什么时候才能看完。
基于8个网页-相关网页
... 多项式分解 polynomial reduction 多项式回归 polynomial regression 多项式残余类别代数 polynomial residue class algebra ...
基于1个网页-相关网页
Efficient polynomial reduction 说明关于多项式消除的有效算法
polynomial time reduction 多项式时间归约
polynomial-time reduction 多项式时间还元
reduction of polynomial 多项式的约化
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题,即是NP完全的。
Polynomial modulo reduction algorithms are one of the fundamental issues of computer algebra, and widely used in coding algorithms and cryptographic system design.
多项式模归约算法是计算机代数中的基本问题之一,在编码算法和密码体制设计中有着广泛应用。
After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.
再次,对有序决策表进行了研究,提出了一种基于优势矩阵的启发式属性约简算法。
应用推荐