Find out how to access previewonly content
Date:
29 May 2008
Complexity measures of sign matrices
 Nati Linial,
 Shahar Mendelson,
 Gideon Schechtman,
 Adi Shraibman
 … show all 4 hide
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.
Supported by the ISF.
Supported by the ARC.
 N. Alon, P. Frankl and V. Rödl: Geometrical realizations of set systems and probabilistic communication complexity, in Proceedings of the 26th Symposium on Foundations of Computer Science, pages 277–280, IEEE Computer Society Press, 1985.
 Alon, N., Spencer, J. H. (2000) The probabilistic method. Wiley, New York
 R. I. Arriaga and S. Vempala: An algorithmic theory of learning: Robust concepts and random projection, in IEEE Symposium on Foundations of Computer Science, pages 616–623, 1999.
 BenDavid, S., Eiron, N., Simon, H. U. (2001) Limitations of learning via embeddings in Euclidean halfspaces. 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 2001, Proceedings. Springer, Berlin, pp. 385401
 Bhatia, R. (1997) Matrix Analysis. SpringerVerlag, New York
 Burges, C. J. C. (1998) A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2: pp. 121167 CrossRef
 J. Forster: A linear lower bound on the unbounded error probabilistic communication complexity, in SCT: Annual Conference on Structure in Complexity Theory, 2001.
 J. Forster, M. Krause, S. V. Lokam, R. Mubarakzjanov, N. Schmitt and H. U. Simon: Relations between communication complexity, linear arrangements, and computational complexity; in Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, pages 171–182, 2001.
 Forster, J., Schmitt, N., Simon, H. U. (2001) Estimating the optimal margins of embeddings in Euclidean half spaces. 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 2001, Proceedings. Springer, Berlin, pp. 402415
 J. Friedman: A proof of alon’s second eigenvalue conjecture, in Proceedings of the thirtyfifth annual ACM symposium on Theory of computing, pages 720–724, ACM Press, 2003.
 F. John: Extremum problems with inequalities as subsidiary conditions, Studies and assays presented to R. Courant in his 60th birthday, pages 187–204, 1948.
 Johnson, W. B., Lindenstrauss, J. (1984) Extensions of lipshitz mappings into a Hilbert space. Conference in modern analysis and probability (New Haven, Conn., 1982). Amer. Math. Soc., Providence, RI, pp. 189206
 Kahn, J., Komlós, J., Szemerédi, E. (1995) On the probability that a random ±1matrix is singular. Journal of the American Mathematical Society 8: pp. 223240 CrossRef
 Kashin, B., Razborov, A. (1998) Improved lower bounds on the rigidity of Hadamard matrices. Mathematical Notes 63: pp. 471475 CrossRef
 E. Kushilevitz and N. Nisan: Communication Complexity, Cambride University Press, 1997.
 S. V. Lokam: Spectral methods for matrix rigidity with applications to sizedepth tradeoffs and communication complexity, in IEEE Symposium on Foundations of Computer Science, pages 6–15, 1995.
 Lobotzky, A., Phillips, R., Sarnak, P. (1988) Ramanujan graphs. Combinatorica 8: pp. 261277 CrossRef
 Margulis, G. A. (1973) Explicit constructions of expanders. Problemy Peredaci Informacii 9: pp. 7180
 Nilli, A. (1991) On the second eigenvalue of a graph. Discrete Math. 91: pp. 207210 CrossRef
 N. Nisan and A. Wigderson: On rank vs. communication complexity, in IEEE Symposium on Foundations of Computer Science, pages 831–836, 1994.
 Paturi, R., Simon, J. (1986) Probabilistic communication complexity. Journal of Computer and System Sciences 33: pp. 106123 CrossRef
 Pisier, G. (1986) Factorization of linear operators and geometry of Banach spaces. Published for the Conference Board of the Mathematical Sciences, Washington, DC
 Pudlák, P., Rödl, V. (1994) Some combinatorialalgebraic problems from complexity theory. Discrete Mathematics 136: pp. 253279 CrossRef
 Shokrollahi, M. A., Spielman, D. A., Stemann, V. (1997) A remark on matrix rigidity. Information Processing Letters 64: pp. 283285 CrossRef
 Talagrand, M. (1996) Concentration of measures and isoperimetric inequalities in product spaces. Publications Mathematiques de l’I.H.E.S. 81: pp. 73205 CrossRef
 Tao, T., Vu, V. (2007) On the singularity probability of random Bernoulli matrices. Journal of the American Mathematical Society 20: pp. 603628 CrossRef
 TomczakJaegermann, N. (1989) BanachMazur distances and finitedimensional operator ideals. Longman Scientific & Technical, Harlow
 Valiant, L. G. (1977) Graphtheoretic arguments in low level complexity. Proc. 6th MFCS 53: pp. 162176
 Vanik, V. N. (1999) The Nature of Statistical Learning Theory. SpringerVerlag, New York
 Title
 Complexity measures of sign matrices
 Journal

Combinatorica
Volume 27, Issue 4 , pp 439463
 Cover Date
 20070701
 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