Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Point visibility graph recognition is NP-hard   Given a 3-SAT formula, a graph can be constructed in polynomial time such
that the graph is a point visibility graph if and only if the 3-SAT formula is
satisfiable. This reduction establishes that the problem of recognition of
point visibility graphs is NP-hard.

35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph