论文信息 - Obtaining a Triangular Matrix by Independent Row-Column Permutations

Obtaining a Triangular Matrix by Independent Row-Column Permutations

Given a square (0, 1)-matrix A, we consider the problem of deciding whether there exists a permutation of the rows and a permutation of the columns of A such that, after these have been carried out, the resulting matrix is triangular. The complexity of the problem was posed as an open question by Wilf [6] in 1997. In 1998, DasGupta et al. [3] seemingly answered the question, proving it is NP-complete. However, we show here that their result is flawed, which leaves the question still open. Therefore, we give a definite answer to this question by proving that the problem is NP-complete. We finally present an exponential-time algorithm for solving the problem.

[1] Leslie Hogben,et al. Combinatorial Matrix Theory , 2013 .

[2] H. S. Wilf. Combinatorics, Geometry and Probability: On Crossing Numbers, and some Unsolved Problems , 1997 .

[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[4] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[5] Tao Jiang,et al. On the complexity and approximation of syntenic distance , 1997, RECOMB '97.

[6] B. N. Nagarsenker. The exact distribution of the likelihood ratio criterion for testing equality of means, variances and covariances , 1975 .

[7] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .