Find out how to access previewonly content
, Volume 27, Issue 4, pp 439463
First online:
Complexity measures of sign matrices
 Nati LinialAffiliated withSchool of Computer Science and Engineering, Hebrew University Email author
 , Shahar MendelsonAffiliated withCentre for Mathematics and its Applications, The Australian National UniversityDepartment of Mathematics, Technion I.I.T
 , Gideon SchechtmanAffiliated withDepartment of Mathematics, Weizmann Institute
 , Adi ShraibmanAffiliated withDepartment of Mathematics, Weizmann Institute
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper we consider four previously known parameters of sign matrices from a complexitytheoretic perspective. The main technical contributions are tight (or nearly tight) inequalities that we establish among these parameters. Several new open problems are raised as well.
Mathematics Subject Classification (2000)
68Q15 68Q17 46B07 68Q32 Title
 Complexity measures of sign matrices
 Journal

Combinatorica
Volume 27, Issue 4 , pp 439463
 Cover Date
 200707
 DOI
 10.1007/s0049300721605
 Print ISSN
 02099683
 Online ISSN
 14396912
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 68Q15
 68Q17
 46B07
 68Q32
 Industry Sectors
 Authors

 Nati Linial ^{(1)}
 Shahar Mendelson ^{(2)} ^{(3)}
 Gideon Schechtman ^{(4)}
 Adi Shraibman ^{(4)}
 Author Affiliations

 1. School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel
 2. Centre for Mathematics and its Applications, The Australian National University, Canberra, ACT, 0200, Australia
 3. Department of Mathematics, Technion I.I.T, Haifa, 32000, Israel
 4. Department of Mathematics, Weizmann Institute, Rehovot, Israel