Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The complexity of bit retrieval   Bit retrieval is the problem of reconstructing a binary sequence from its
periodic autocorrelation, with applications in cryptography and x-ray
crystallography. After defining the problem, with and without noise, we
describe and compare various algorithms for solving it. A geometrical
constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the
best algorithm for noisy bit retrieval.

30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex