Bruno Codenotti  Home/Search
Context
Related
| webcache.ms.mff.cuni.cz/~k...s473.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: webcache.ms.mff.cuni.cz/...kamser (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction These notes contain an arbitrary selection of topics in a scientific area at the intersection between linear algebra and combinatorics. These topics arise in connection with problems in theoretical computer science, especially in the realm of lower bound issues, and are, to my personal taste, quite fascinating. They reveal a deep connection between linear algebra and combinatorics, as well as the need to combine tools from both areas in order to attack hard computational... (Update)
Similar documents based on text: More All
0.8: On the Lovász number of Certain Circulant Graphs - Brimkov, Codenotti.. (1999) (Correct)
0.8: Some remarks on the Shannon capacity of odd cycles - Codenotti, Gerace, Resta (Correct)
0.6: Comment 01 on - Electronic Colloquium On (1997) (Correct)
BibTeX entry: (Update)
@misc{ codenotti-intersections,
author = "Bruno Codenotti",
title = "Intersections between linear algebra and combinatorics: selection of some
case studies for Spring School 2000",
url = "citeseer.ist.psu.edu/codenotti00intersections.html" }
Citations (may not include all citations):60 IEEE Transactions on Information Theory (context) - Lov'asz, Shannon et al. - 1979
54 Las Vegas is better than determinism in VLSI and distributed.. (context) - Mehlhorn, Schmidt - 1982
48 The zero-error capacity of a noisy channel (context) - Shannon - 1956
43 Intersection theorems for systems of sets (context) - Erdos, Rado - 1960
41 Graph-theoretic arguments in low level complexity (context) - Valiant - 1977
30 The Sandwich Theorem - Knuth - 1994
26 Communication complexity: a survey (context) - Lov'asz
23 Explicit Ramsey graphs and orthonormal labelings - Alon - 1994
11 The rank and size of graphs (context) - Kotlov, Lov'asz - 1996
10 On Rank vs Communication Complexity - Nisan, Wigderson - 1994
8 Large sets of nearly orthogonal vectors (context) - Alon, Szegedy
6 Some structural properties of low rank matrices related to c.. - Codenotti, Pudl'ak et al. - 2000
6 Almost orthogonal lines in E d (context) - Rosenfeld - 1991
4 Mobius functions and communication complexity (context) - Lov'asz, Saks - 1988
3 Bolyai Society Mathematical Studies (context) - Lov'asz, on et al. - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://webcache.ms.mff.cuni.cz/acad/kam/serie/kamser.html): More
Combinatorics Of Mappings (Graph Homomorphisms and Their Use) - Nesetril (2000) (Correct)
A Theory of Pfaffian Orientations I: Perfect Matchings and.. - Galluccio, Loebl (1997) (Correct)
Midsummer Combinatorial Workshop VI - Prague Ju Ly (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC