Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: IV-matching is strongly NP-hard   IV-matching is a generalization of perfect bipartite matching. The complexity
of finding IV-matching in a graph was posted as an open problem at the ICALP
2014 conference.
  In this note, we resolve the question and prove that, contrary to the
expectations of the authors, the given problem is strongly NP-hard (already in
the simplest non-trivial case of four layers). Hence it is unlikely that there
would be an efficient (polynomial or pseudo-polynomial) algorithm solving the
problem.

22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
27
The categories of this paper are: comp-gas