Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Atypical Survey of Typical-Case Heuristic Algorithms   Heuristic approaches often do so well that they seem to pretty much always
give the right answer. How close can heuristic algorithms get to always giving
the right answer, without inducing seismic complexity-theoretic consequences?
This article first discusses how a series of results by Berman, Buhrman,
Hartmanis, Homer, Longpr\'{e}, Ogiwara, Sch\"{o}ening, and Watanabe, from the
early 1970s through the early 1990s, explicitly or implicitly limited how well
heuristic algorithms can do on NP-hard problems. In particular, many desirable
levels of heuristic success cannot be obtained unless severe, highly unlikely
complexity class collapses occur. Second, we survey work initiated by Goldreich
and Wigderson, who showed how under plausible assumptions deterministic
heuristics for randomized computation can achieve a very high frequency of
correctness. Finally, we consider formal ways in which theory can help explain
the effectiveness of heuristics that solve NP-hard problems in practice.

10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
4
The categories of this paper are: cond-mat
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an