Common Information and Unique Disjointness-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Common Information and Unique Disjointness

Published:2016-02-22 Issue:3 Volume:76 Page:597-629
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Braun Gábor,Pokutta Sebastian

Funder

NSF

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-016-0132-0.pdf

Reference38 articles.

1. Arora, S., Ge, R., Kannan, R., Moitra, A.: Computing a nonnegative matrix factorization-provably. In: Proceedings of the 44th Symposium on Theory of Computing, pp. 145–162. ACM (2012)

2. Avis, D., Tiwary, H.R.: On the extension complexity of combinatorial polytopes. Math. Program. Ser. B 153(1), 95–115 (2015). doi: 10.1007/s10107-014-0764-2

3. Bar-Yossef, Z., Jayram, T., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702–732 (2004). doi: 10.1016/j.jcss.2003.11.006

4. Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26, 193–205 (2001). doi: 10.1287/moor.26.2.193.10561

5. Braun, G., Pokutta, S.: The matching polytope does not admit fully-polynomial size relaxation schemes. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 837–846 (2015)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. XOR Lemmas for Communication via Marginal Information;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack;Lecture Notes in Computer Science;2024

3. Complex psd-minimal polytopes in dimensions two and three;Journal of Algebra and Its Applications;2022-11-10

4. Conditional and Relevant Common Information;Information and Inference: A Journal of the IMA;2022-01-25

5. On Exact and ∞-Rényi Common Informations;IEEE Transactions on Information Theory;2020-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3