Abstract
The sign pattern of a real matrix A is the matrix obtained by replacing each entry of A by its sign. A real matrix A is an L- matrix if every real matrix with the same sign pattern as A has linearly independent columns. L-matrices arise naturally in and are essential to the study of sign-solvability and related notions. In special cases, the L-matrix property has connections to the even dicycle problem, Pfaffian orientations, and Pólya’s permanent problem. Unfortunately, the problem of recognizing L-matrices is known to be co- NP -complete in general. We elaborate in this vein by showing a polynomial-time inapproximability result for Max-not- L -rows, a particular optimization version of L-matrix recognition, by means of an approximation-preserving reduction from the previously studied problem Max-not-equal-2-Sat.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
