Complexity measures of sign matrices

Authors:
Nati Linial;Shahar Mendelson;Gideon Schechtman;Adi Shraibman
Affiliations:
Hebrew University, School of Computer Science and Engineering, Jerusalem, Israel;The Australian National University, Centre for Mathematics and its Applications, 0200, Canberra, ACT, Australia and Technion I.I.T, Department of Mathematics, Haifa, 32000, Israel;Weizmann Institute, Department of Mathematics, 0200, Rehovot, ACT, Israel;Weizmann Institute, Department of Mathematics, 0200, Rehovot, ACT, Israel
Venue:
Combinatorica
Year:
2007

Citing 0
Cited 12

Lower bounds in communication complexity based on factorization norms

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Halfspace Matrices

Computational Complexity
Learning complexity vs communication complexity

Combinatorics, Probability and Computing
Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science
A lower bound for agnostically learning disjunctions

COLT'07 Proceedings of the 20th annual conference on Learning theory
Composition theorems in communication complexity

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The Sign-Rank of AC$^0$

SIAM Journal on Computing
Strong direct product theorems for quantum communication and query complexity

Proceedings of the forty-third annual ACM symposium on Theory of computing
Rank, trace-norm and max-norm

COLT'05 Proceedings of the 18th annual conference on Learning Theory
The communication complexity of non-signaling distributions

Quantum Information & Computation
Quantum strategies are better than classical in almost any XOR game

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The approximate rank of a matrix and its algorithmic applications: approximate rank

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.