使用多项式次数下限比较EQP和MOD_{p^k} P
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
摘要：
我们证明了一个包含长度为n的所有字符串的1/4或3/4的oracle A可以用来将EQP从计数类MOD_{p^k} P中分离出来。我们的证明利用了大小为p^k的有限域上的表示多项式的次数。我们证明了这个多项式的度的线性下界。当m是一个具有最大素因子p的无平方因子合成时，我们还证明了模m整数环上的度的上界为O（n^{1/log_pm}）.
英文摘要：
We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting classes MOD_{p^k}P. Our proof makes use of the degree of a representing polynomial over the finite field of size p^k. We show a linear lower bound on the degree of this polynomial. We also show an upper bound of O(n^{1/log_p m}) on the degree over the ring of integers modulo m, whenever m is a squarefree composite with largest prime factor p.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
