期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2011
卷号：2011
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various settings of the parameters ndp and q, our results indicate that symmetric polynomials yield the maximum correlation. This contrasts with the previously-analyzed settings of parameters, where non-symmetric polynomials yield the maximum correlation.
We also prove new properties of maximum-correlation polynomials, and use those to obtain a new setting of parameters where those polynomials are not symmetric.
关键词：brute-force search, Correlation, mod function, polynomial
