Communication Lower Bounds for Collision Problems via Density Increment Arguments

Author:

Yang Guangxu1ORCID,Zhang Jiapeng1ORCID

Affiliation:

1. University of Southern California, Los Angeles, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Reference21 articles.

1. Quantum lower bound for the collision problem

2. Scott Aaronson Robin Kothari William Kretschmer and Justin Thaler. 2019. Quantum lower bounds for approximate counting via laurent polynomials. arXiv preprint arXiv:1904.08914.

3. Balthazar Bauer, Pooya Farshim, and Sogol Mazaheri. 2018. Combiners for backdoored random oracles. In Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II 38. 272–302.

4. Quantum Algorithms for Testing Properties of Distributions

5. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, and Toniann Pitassi. 2019. Query-to-communication lifting for BPP using inner product. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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