2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/140282This 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 pagesComputational Complexitytext