Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds   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.

23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat