A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time

被引：0
|
作者：
Pierre Lairez
机构：
[1] Technische Universität Berlin,Institut für Mathematik
来源：
Foundations of Computational Mathematics | 2017年 / 17卷
关键词：
Polynomial system; Homotopy continuation; Complexity; Smale’s 17th problem; Derandomization; Primary 68Q25; Secondary 65H10; 65H20; 65Y20;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum–Shub–Smale model with square root. It rests upon a derandomization of an algorithm of Beltrán and Pardo and gives a deterministic affirmative answer to Smale’s 17th problem. The main idea is to make use of the randomness contained in the input itself.
引用
收藏
页码：1265 / 1292
页数：27
相关论文
共 50 条
  • [21] An algorithm to compute the Teichmuller polynomial from matrices
    Baik, Hyungryul
    Wu, Chenxi
    Kim, KyeongRo
    Jo, TaeHyouk
    GEOMETRIAE DEDICATA, 2020, 204 (01) : 175 - 189
  • [22] Plantinga-Vegter Algorithm takes Average Polynomial Time
    Cucker, Felipe
    Erguer, Alperen A.
    Tonelli-Cueto, Josue
    PROCEEDINGS OF THE 2019 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC '19), 2019, : 114 - 121
  • [23] Explicit separation of relativised random polynomial time and relativised deterministic polynomial time
    Zippel, Richard, 1600, (33):
  • [24] Implementation of the FGLM algorithm and finding roots of polynomial involutive systems
    Gerdt, VP
    Yanovich, DA
    PROGRAMMING AND COMPUTER SOFTWARE, 2003, 29 (02) : 72 - 74
  • [25] Implementation of the FGLM Algorithm and Finding Roots of Polynomial Involutive Systems
    V. P. Gerdt
    D. A. Yanovich
    Programming and Computer Software, 2003, 29 : 72 - 74
  • [26] Implementation of the FGLM algorithm and finding roots of polynomial involutive systems
    Gerdt, V.P.
    Yanovich, D.A.
    Programmirovanie, 2003, 29 (02): : 23 - 26
  • [27] Toward a deterministic polynomial time algorithm with optimal additive query complexity
    Bshouty, Nader H.
    Mazzawi, Hanna
    THEORETICAL COMPUTER SCIENCE, 2012, 417 : 23 - 35
  • [28] Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
    Bshouty, Nader H.
    Mazzawi, Hanna
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 221 - 232
  • [29] The threat of a deterministic polynomial time algorithm for primality testing in applied cryptography
    Obimbo, C
    Doxsee, S
    MSV'04 & AMCS'04, PROCEEDINGS, 2004, : 423 - 426
  • [30] A deterministic polynomial time algorithm for Heilbronn's problem in dimension three
    Lefmann, H
    Schmitt, N
    LATIN 2002: THEORETICAL INFORMATICS, 2002, 2286 : 165 - 180
12345