Combinatorica

, Volume 27, Issue 4, pp 439–463

Complexity measures of sign matrices

  • Nati Linial
  • Shahar Mendelson
  • Gideon Schechtman
  • Adi Shraibman
Article

DOI: 10.1007/s00493-007-2160-5

Cite this article as:
Linial, N., Mendelson, S., Schechtman, G. et al. Combinatorica (2007) 27: 439. doi:10.1007/s00493-007-2160-5

Abstract

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 problems are raised as well.

Mathematics Subject Classification (2000)

68Q1568Q1746B0768Q32

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  • Nati Linial
    • 1
  • Shahar Mendelson
    • 2
    • 3
  • Gideon Schechtman
    • 4
  • Adi Shraibman
    • 4
  1. 1.School of Computer Science and EngineeringHebrew UniversityJerusalemIsrael
  2. 2.Centre for Mathematics and its ApplicationsThe Australian National UniversityCanberraAustralia
  3. 3.Department of MathematicsTechnion I.I.THaifaIsrael
  4. 4.Department of MathematicsWeizmann InstituteRehovotIsrael