Skip navigation
Skip navigation

Complexity measures of sign matrices

Linial, Nati; Mendelson, Shahar; Schechtman, Gideon; Schraibman, Adi


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

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
Source: Combinatorica
DOI: 10.1007/s00493-007-2160-5


File Description SizeFormat Image
01_Linial_Complexity_measures_of_sign_2007.pdf281.92 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator