P-matrix recognition is co-NP-complete
arXiv:0710.3519
Abstract
This is a summary of the proof by G.E. Coxson that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn.
9 pages