Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory

Author:

Bhowmick Abhishek1ORCID,Lovett Shachar2ORCID

Affiliation:

1. Department of Computer Science, The University of Texas at Austin, Austin, TX, USA

2. Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, USA

Funder

NSF

NSF Career

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Reference44 articles.

1. Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets;tao;arXiv 1211 2894,2012

2. Regular partitions of graphs;szemerédi;Problèmes Combinatoires et Théorie des Graphes,1978

3. Detecting Rational Points on Hypersurfaces over Finite Fields

4. Sharp Effective Nullstellensatz

5. Learning Decision Trees Using the Fourier Spectrum

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

1. Partition and analytic rank are equivalent over large fields;Duke Mathematical Journal;2023-09-01

2. Quantitative inverse theorem for Gowers uniformity norms and in;Canadian Journal of Mathematics;2023-06-15

3. Structure vs. randomness for bilinear maps;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

4. A note on extensions of multilinear maps defined on multilinear varieties;Proceedings of the Edinburgh Mathematical Society;2021-04-30

5. Polynomial bound for the Partition Rank vs the Analytic Rank of Tensors;discrete Analysis;2020-05-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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