Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Root optimization of polynomials in the number field sieve   The general number field sieve (GNFS) is the most efficient algorithm known
for factoring large integers. It consists of several stages, the first one
being polynomial selection. The quality of the chosen polynomials in polynomial
selection can be modelled in terms of size and root properties. In this paper,
we describe some algorithms for selecting polynomials with very good root
properties.

25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
19
The categories of this paper are: eess