Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomially Solvable Instances of the Shortest and Closest Vector
  Problems with Applications to Compute-and-Forward   A particular instance of the Shortest Vector Problem (SVP) appears in the
context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will
show that this certain instance can be solved in complexity order
$O(n\psi\log(n\psi))$ where $\psi = \sqrt{P\|{\bf h}\|^2+1}$ depends on the
transmission power and the norm of the channel vector. We will then extend our
results to Integer-Forcing and finally, introduce a more general class of
lattices for which the SVP and the and the Closest Vector Problem (CVP) can be
approximated within a constant factor.

23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph