Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Complexity of Counting Models of Linear-time Temporal Logic   We determine the complexity of counting models of bounded size of
specifications expressed in Linear-time Temporal Logic. Counting word models is
#P-complete, if the bound is given in unary, and as hard as counting accepting
runs of nondeterministic polynomial space Turing machines, if the bound is
given in binary. Counting tree models is as hard as counting accepting runs of
nondeterministic exponential time Turing machines, if the bound is given in
unary. For a binary encoding of the bound, the problem is at least as hard as
counting accepting runs of nondeterministic exponential space Turing machines.
On the other hand, it is not harder than counting accepting runs of
nondeterministic doubly-exponential time Turing machines.

30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
11
The categories of this paper are: hep-lat