论文部分内容阅读
{1,-1}~(?)上二次多项式的极大化是NP-难题,对研究这个问题所做的主要努力是识别出多项式时间可解的特殊情况,并给出近似方法。本文将一类系数取自{1,-1}上的{1,-1}~(?)上二次多项式极大化问题变成线性分组码的最小距离译码问题。线性分组码的最小距离译码是NP-难问题,但有些情况可解。本文研究了一类线性分组码的译码算法,这种算法可用来优化一类{1,-l}~(?)上的二次函数。
The maximization of the quadratic polynomial on {1, -1} ~ (?) Is an NP-hard problem. The main effort to study this problem is to identify the special case where the polynomial time is solvable and give an approximate method. In this paper, a class of coefficients from the {1, -1} on {1, -1} ~ (?) Quadratic polynomial maximization problem into linear block codes minimum distance decoding problem. The minimum distance decoding of linear block codes is NP-hard, but in some cases solvable. This paper studies a class of linear block codes decoding algorithm, which can be used to optimize a class of quadratic functions on {1, -l} ~ (?).