Common Information and Unique Disjointness
- 22 February 2016
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 76 (3) , 597-629
Abstract
No abstract availableKeywords
Funding Information
- NSF (CMMI-1300144)
This publication has 30 references indexed in Scilit:
- Combinatorial bounds on nonnegative rank and extended formulationsDiscrete Mathematics, 2013
- Extended Formulations for PolygonsDiscrete & Computational Geometry, 2012
- Extended formulations in combinatorial optimization4OR, 2010
- An information statistics approach to data stream and communication complexityJournal of Computer and System Sciences, 2004
- Nondeterministic Quantum Query and Communication ComplexitiesSIAM Journal on Computing, 2003
- On the distributional complexity of disjointnessTheoretical Computer Science, 1992
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- Divergence measures based on the Shannon entropyIEEE Transactions on Information Theory, 1991
- Values and Bounds for the Common Information of Two Discrete Random VariablesSIAM Journal on Applied Mathematics, 1976
- The common information of two dependent random variablesIEEE Transactions on Information Theory, 1975