Complexity measures of sign matrices
In this paper we consider four previously known parameters of sign matrices from a complexity-theoretic perspective. The main technical contributions are tight (or nearly tight) inequalities that we establish among these parameters. Several new open probl
|Collections||ANU Research Publications|
|01_Linial_Complexity_measures_of_sign_2007.pdf||281.92 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.