A note on the communication complexity of totally unimodular matrices

Linear algebraic methods in communication complexity

Deaett, Louis
Srinivasan, Venkatesh

June 2012

AbstractThe notion of communication complexity seeks to capture the amount of communication between ...

Tradeoffs between communication and space

Tiwari, Prasoon
Lam, Tak
Tompa, Martin

January 1989

This paper initiates the study of communication complexity when the processors have limited work spa...

Characterizations of totally unimodular, balanced and perfect matrices

Padberg, Manfred W. (Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH Internationales Institut fuer Management und Verwaltung, Berlin (Germany))
Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH, Berlin (Germany)

January 1974

SIGLEUuStB Koeln(38)-861100940 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...

A note on the communication complexity of totally unimodular matrices

Kern, W.
Faigle, U.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten.
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1988

SIGLETIB Hannover: RO 3318(70) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...

The complexity of communication

Lovasz, Laszlo

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Communication complexity: a survey

Lovasz, Laszlo

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Matrix rank and communication complexity

Codenotti B
Del Corso G
Manzini G

January 2000

The rank of a matrix seems to play a role in the context of communication complexity, a framework de...

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)

Beasley, LeRoy B.
Klauck, Hartmut
Lee, Troy
Theis, Dirk Oliver

January 2013

This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexi...

Matrix rank and communication complexity

Codenotti, Bruno
Del Corso, Gianna
Manzini, Giovanni

January 2000

AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...

Some order dimension bounds for communication complexity problems

Faigle, Ulrich
Kern, Walter

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Communication complexity

Wagner, Vojtěch

January 2012

Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor:...

On relations between counting communication complexity classes

Damm, Carsten
Krause, Matthias
Meinel, Christoph
Waack, Stephan

September 2004

AbstractWe develop upper and lower bound arguments for counting acceptance modes of communication pr...

Communication complexity The model

Lila (csc Lecture

October 2015

Matrix Mf has entries Mf [x, y] = f (x, y). A submatrix is monochromatic if f is constant on inputs...

LECTURE

Instructor Alexander Sherstov
Scribe Max Ohlendorf
Lower Bounds
Deterministic Communication

January 2012

This lecture builds on the material from our first lecture, providing more tools for studying commun...

A decomposition of strongly unimodular matrices into incidence matrices of digraphs

Crama, Yves
Loebl, Martin
Poljak, Svatopluk

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Linear algebraic methods in communication complexity

Deaett, Louis
Srinivasan, Venkatesh

June 2012

AbstractThe notion of communication complexity seeks to capture the amount of communication between ...

Tradeoffs between communication and space

Tiwari, Prasoon
Lam, Tak
Tompa, Martin

January 1989

This paper initiates the study of communication complexity when the processors have limited work spa...

Characterizations of totally unimodular, balanced and perfect matrices

Padberg, Manfred W. (Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH Internationales Institut fuer Management und Verwaltung, Berlin (Germany))
Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH, Berlin (Germany)

January 1974

SIGLEUuStB Koeln(38)-861100940 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...

A note on the communication complexity of totally unimodular matrices

Kern, W.
Faigle, U.
Bonn Univ. (Germany). Sonderforschungsbereich 303 - Information und die Koordination Wirtschaftlicher Aktivitaeten.
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1988

SIGLETIB Hannover: RO 3318(70) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...

The complexity of communication

Lovasz, Laszlo

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Communication complexity: a survey

Lovasz, Laszlo

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Matrix rank and communication complexity

Codenotti B
Del Corso G
Manzini G

January 2000

The rank of a matrix seems to play a role in the context of communication complexity, a framework de...

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)

Beasley, LeRoy B.
Klauck, Hartmut
Lee, Troy
Theis, Dirk Oliver

January 2013

This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexi...

Matrix rank and communication complexity

Codenotti, Bruno
Del Corso, Gianna
Manzini, Giovanni

January 2000

AbstractThe rank of a matrix seems to play a role in the context of communication complexity, a fram...

Some order dimension bounds for communication complexity problems

Faigle, Ulrich
Kern, Walter

January 1990

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Communication complexity

Wagner, Vojtěch

January 2012

Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor:...

On relations between counting communication complexity classes

Damm, Carsten
Krause, Matthias
Meinel, Christoph
Waack, Stephan

September 2004

AbstractWe develop upper and lower bound arguments for counting acceptance modes of communication pr...

Communication complexity The model

Lila (csc Lecture

October 2015

Matrix Mf has entries Mf [x, y] = f (x, y). A submatrix is monochromatic if f is constant on inputs...

LECTURE

Instructor Alexander Sherstov
Scribe Max Ohlendorf
Lower Bounds
Deterministic Communication

January 2012

This lecture builds on the material from our first lecture, providing more tools for studying commun...

A decomposition of strongly unimodular matrices into incidence matrices of digraphs

Crama, Yves
Loebl, Martin
Poljak, Svatopluk

January 1989

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Linear algebraic methods in communication complexity

Deaett, Louis
Srinivasan, Venkatesh

June 2012

AbstractThe notion of communication complexity seeks to capture the amount of communication between ...

Tradeoffs between communication and space

Tiwari, Prasoon
Lam, Tak
Tompa, Martin

January 1989

This paper initiates the study of communication complexity when the processors have limited work spa...

Characterizations of totally unimodular, balanced and perfect matrices

Padberg, Manfred W. (Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH Internationales Institut fuer Management und Verwaltung, Berlin (Germany))
Wissenschaftszentrum Berlin fuer Sozialforschung gGmbH, Berlin (Germany)

January 1974

SIGLEUuStB Koeln(38)-861100940 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informa...

A note on the communication complexity of totally unimodular matrices

Abstract

Extracted data

A note on the communication complexity of totally unimodular matrices

Abstract

Extracted data

Related items

Related items