P-matrix recognition is co-NP-complete
Jan Foniok
TL;DR
This paper proves that recognizing P-matrices is a computationally hard problem, specifically co-NP-complete, by reducing from the MAX CUT problem and building on previous results.
Contribution
It establishes the co-NP-completeness of P-matrix recognition, providing a significant complexity classification for this problem.
Findings
P-matrix recognition is co-NP-complete
Reduction from MAX CUT demonstrates computational hardness
Builds on prior results by Poljak and Rohn
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · semigroups and automata theory · graph theory and CDMA systems