The Complexity of Checking Partial Total Positivity

Daniel Carter, Charles Johnson

We prove that checking if a partial matrix is partial totally positive is co-NP-complete. This contrasts with checking a conventional matrix for total positivity, which may be done in cubic time. Checking partial sign regularity with any signature, including partial total nonnegativity, is also co-NP-complete.

Knowledge Graph



Sign up or login to leave a comment