期刊
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
卷 34, 期 2, 页码 809-826出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11424-020-9164-2
关键词
Algebraic space curve; bit complexity; topology
资金
- Hubei Provincial Natural Science Foundation of China [2020CFB479]
- Research and Development Funds of Hubei University of Science and Technology [BK202024]
- National Natural Science Foundation of China [11471327]
The paper presents an algorithm for computing the topology of an algebraic space curve, which is a modified version of a previous algorithm. The authors also analyze the bit complexity of the algorithm, which has the best bounds among existing work. Additionally, the paper includes content from conference papers CASC 2014 and SNC 2014.
This paper presents an algorithm to compute the topology of an algebraic space curve. This is a modified version of the previous algorithm. Furthermore, the authors also analyse the bit complexity of the algorithm, which is O similar to(N-20), where N = max{d, tau}, d and tau are the degree bound and the bit size bound of the coefficients of the defining polynomials of the algebraic space curve. To our knowledge, this is the best bound among the existing work. It gains the existing results at least N-2. Meanwhile, the paper contains some contents of the conference papers (CASC 2014 and SNC 2014).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据