Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Nondeterminism and an abstract formulation of Ne\v{c}iporuk's lower
  bound method   A formulation of "Ne\v{c}iporuk's lower bound method" slightly more inclusive
than the usual complexity-measure-specific formulation is presented. Using this
general formulation, limitations to lower bounds achievable by the method are
obtained for several computation models, such as branching programs and Boolean
formulas having access to a sublinear number of nondeterministic bits. In
particular, it is shown that any lower bound achievable by the method of
Ne\v{c}iporuk for the size of nondeterministic and parity branching programs is
at most $O(n^{3/2}/\log n)$.

18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int