A $$\tau $$ τ -Conjecture for Newton Polygons-Reference-Cited by-同舟云学术

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

A $$\tau $$ τ -Conjecture for Newton Polygons

Published:2014-10-23 Issue:1 Volume:15 Page:185-197
ISSN:1615-3375
Container-title:Foundations of Computational Mathematics
language:en
Short-container-title:Found Comput Math

Author:

Koiran Pascal,Portier Natacha,Tavenas Sébastien,Thomassé Stéphan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10208-014-9216-x.pdf

Reference28 articles.

1. M. Agrawal and V. Vinay. Arithmetic circuits: A chasm at depth four. In Proc. 49th IEEE Symposium on Foundations of Computer Science, pages 67–75, 2008.

2. O. Bílka, K. Buchin, R. Fulek, M. Kiyomi, Y. Okamoto, S.I. Tanigawa, and C.D. Tóth. A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets. Electr. J. Comb., 17(1), 2010.

3. L. Blum, F. Cucker, M. Shub, and S. Smale. Algebraic settings for the problem “ $$\text{ P } \ne \text{ NP }?$$ P ≠ NP ? ”. In J. Renegar, M. Shub, and S. Smale, editors, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics, pages 125–144. American Mathematical Society, 1996.

4. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1–46, July 1989.

5. A. Borodin and S. Cook. On the number additions to compute specific polynomials. SIAM Journal on Computing, 5(1):146–157, 1976.

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

1. Monotone classes beyond VNP;Theoretical Computer Science;2024-09

2. Shadows of Newton polytopes;Israel Journal of Mathematics;2023-09

3. Real $$\tau $$-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization;Computer Science – Theory and Applications;2021

4. On the distribution of runners on a circle;European Journal of Combinatorics;2020-10

5. How many zeros of a random sparse polynomial are real?;Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation;2020-07-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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