A linear lower bound on the unbounded error probabilistic communication complexity

Author:

Forster Jürgen

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference17 articles.

1. N. Alon, P. Frankl, V. Rödl, Geometrical realization of set systems and probabilistic communication complexity, Proceedings of the 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Portland, OR, 1985.

2. S. Ben-David, N. Eiron, H.U. Simon, Limitations of learning via embeddings in Euclidean half-spaces (David P. Helmbold and Bob Williamson, Eds.), Proceedings of the 14th Annual Workshop on Computational Learning Theory, Springer, Berlin, Heidelberg, 2001.

3. Learnability and the Vapnik–Chervonenkis dimension;Blumer;J. ACM,1989

4. An Introduction to Support Vector Machines;Cristianini,2000

5. J. Forster, A linear lower bound on the unbounded error probabilistic communication complexity (Francis M. Titsworth, Ed.), Proceedings of the 16th IEEE Annual Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 100–106.

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

1. A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. A Quiver Invariant Theoretic Approach to Radial Isotropy and the Paulsen Problem for Matrix Frames;SIAM Journal on Applied Algebra and Geometry;2022-11-14

4. Dimension-free bounds and structural results in communication complexity;Israel Journal of Mathematics;2022-10-20

5. Beyond Natural Proofs: Hardness Magnification and Locality;Journal of the ACM;2022-08-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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