Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Considerations on P vs NP   In order to prove that the P of problems is different to the NP class, we
consider the satisfability problem of propositional calculus formulae, which is
an NP-complete problem. It is shown that, for every search algorithm A, there
is a set E(A) containing propositional calculus formulae, each of which
requires the algorithm A to take non-polynomial time to find the truth-values
of its propositional letters satisfying it. Moreover, E(A)'s size is an
exponential function of n, which makes it impossible to detect such formulae in
a polynomial time. Hence, the satisfability problem does not have a polynomial
complexity

34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
3
The categories of this paper are: physics