arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.3568cs.CC
收藏

计算GF(3 ^q)中积和式的多项式时间算法

A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)

Vadim Tarin

摘要:

本文给出了一个计算特征为3的域上的积和式的多项式时间算法。用于此目的的主要对象是柯西和范德蒙矩阵,判别函数及其各种类型的推广。经典的定理,如Binet-Minc恒等式和Borchadt公式的永久被广泛应用,而一个特殊的新技术涉及的概念,重新定义的有限特征和相应的计算方法的领域,以处理一些多项式时间的减少。所有的构造都保持严格的代数性质,忽略了基本域的结构,同时应用其无限扩展来计算极限。在一个特征不同于2的域中,永久式的多项式时间可计算性的一个自然推论是复杂性类P和NP之间的非一致相等,这等价于RP=NP(参考文献[1])。

英文摘要:

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and their generalizations of various types. Classical theorems on the permanent such as the Binet-Minc identity and Borchadt's formula are widely applied, while a special new technique involving the notion of limit re-defined for fields of finite characteristics and corresponding computational methods was developed in order to deal with a number of polynomial-time reductions. All the constructions preserve a strictly algebraic nature ignoring the structure of the basic field, while applying its infinite extensions for calculating limits. A natural corollary of the polynomial-time computability of the permanent in a field of a characteristic different from 2 is the non-uniform equality between the complexity classes P and NP what is equivalent to RP=NP (Ref. [1]).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑