Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Separating Points by Lines   Given a set $P$ of $n$ points in the plane, its separability is the minimum
number of lines needed to separate all its pairs of points from each other. We
show that the minimum number of lines needed to separate $n$ points, picked
randomly (and uniformly) in the unit square, is $\Theta( n^{2/3})$, where
$\Theta$ hides polylogarithmic factors. In addition, we provide a fast
approximation algorithm for computing the separability of a given point set in
the plane. Finally, we point out the connection between separability and
partitions.

12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
3
The categories of this paper are: physics
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga
28
The categories of this paper are: alg-geom