Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computing points of bounded height in projective space over a number
  field   We construct an algorithm for solving the following problem: given a number
field $K$, a positive integer $N$, and a positive real number $B$, determine
all points in $\mathbb P^N(K)$ having relative height at most $B$. A
theoretical analysis of the efficiency of the algorithm is provided, as well as
sample computations showing how the algorithm performs in practice. Two
variants of the method are described, and examples are given to compare their
running times. In the case $N=1$ we compare our method to an earlier algorithm
for enumerating elements of bounded height in number fields.

36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
1
The categories of this paper are: cs
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con