Improved Hardness of Approximating k-Clique under ETH-Reference-Cited by-同舟云学术

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

Improved Hardness of Approximating k-Clique under ETH

Published:2023-11-06 Issue: Volume: Page:
ISSN:
Container-title:2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Lin Bingkai¹,Ren Xuandi²,Sun Yican³,Wang Xiuhan⁴

Affiliation:

1. Nanjing University,State Key Laboratory for Novel Software Technology,Nanjing,China

2. University of California at Berkeley,Department of Computer Science,Berkeley,USA

3. Peking University,School of Computer Science,Beijing,China

4. Tsinghua University,Department of Computer Science,Beijing,China

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10353068/10353072/10353136.pdf?arnumber=10353136

Reference35 articles.

1. Constant approximating k-clique is w[1]-hard

2. On lower bounds of approximating parameterized k-clique;Lin;49th International Colloquium on Automata, Languages, and Programming, ICALp 2022,2022

3. A Geometric Approach to Information-Theoretic Private Information Retrieval

4. Reducibility among Combinatorial Problems

5. Efficient probabilistically checkable proofs and applications to approximations

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP