P-matrix recognition is co-NP-complete

Details P-matrix recognition is co-NP-complete P-matrix recognition is co-NP-complete

2007-10-18

arxiv.org/abs/0710.3519v1

Computer Science

Computational Complexity

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

P-matrix recognition is co-NP-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with P-matrix recognition is co-NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P-matrix recognition is co-NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461292