8 citations · 9 across the 3 of their papers we have counts for
1 paper · 1 filter
Jan Foniok
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…