On the Complexity of Computing the Topology of Real Algebraic Space Curves

作     者：JIN Kai CHENG Jinsan JIN Kai;CHENG Jinsan

作者机构：School of Mathematics and StatisticsHubei University of Science and TechnologyXianning 437100China Key Lab of Mathematics Mechanization Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2021年第34卷第2期

页      面：809-826页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Hubei Provincial Natural Science Foundation of China under Grant No.2020CFB479 the Research and Development Funds of Hubei University of Science and Technology under Grant No.BK202024 the National Natural Science Foundation of China under Grant No.11471327 

主　　题：Algebraic space curve bit complexity topology 

摘      要：This paper presents an algorithm to compute the topology of an algebraic space *** is a modified version of the previous ***,the authors also analyse the bit complexity of the algorithm,which is O(N^(20)),where N=max{d,τ},d andτare the degree bound and the bit size bound of the coefficients of the defining polynomials of the algebraic space *** our knowledge,this is the best bound among the existing *** gains the existing results at least N^(2).Meanwhile,the paper contains some contents of the conference papers(CASC 2014 and SNC 2014).