Unambiguous DNFs and Alon–Saks–Seymour-Reference-Cited by-同舟云学术

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

Unambiguous DNFs and Alon–Saks–Seymour

Published:2023-10-20 Issue: Volume: Page:FOCS21-157-FOCS21-173
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Balodis Kaspars¹^ORCID,Ben-David Shalev²,Göös Mika³,Jain Siddhartha⁴,Kothari Robin⁵^ORCID

Affiliation:

1. Faculty of Computing, University of Latvia, Riga LV-1586, Latvia.

2. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada.

3. School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland.

4. Department of Computer Science, University of Texas at Austin, Austin, TX 78705 USA.

5. Microsoft Quantum, Redmond, WA 98052 USA.

Funder

Swiss State Secretariat for Education, Research and Innovation

European Regional Development Fund

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference14 articles.

1. Some improved bounds on communication complexity via new decomposition of cliques

2. Decomposition techniques applied to the Clique-Stable set separation problem

3. Clique versus independent set

4. Subdivided Claws and the Clique-Stable Set Separation Property

5. More Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP