Polynomial expressions for non-binomial structures

作     者：Sabeti, Rostam 

作者机构：Great Lakes Assoc Algebra & Computat 4258 Graystone Dr Okemos MI 48864 USA 

出 版 物：《THEORETICAL COMPUTER SCIENCE》 (理论计算机科学)

年 卷 期：2019年第762卷

页      面：13-24页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Algebraic expressions Division algorithms Cyclic n-roots 

摘      要：Following recent paper of the author about polynomial expressions with respect to binomial ideals, the current paper is devoted to the non-binomial case. Beside the established facts in the underlying theory, the correctness and termination of the algorithms are addressed. From the collection of examples, the main large-scale nonbinomial one is of particular importance. Application of the new algorithms for the cases of moderately large binomial like cyclic 16-roots and cyclic 18-roots is discussed. A combinatorial analysis for complexity of the proposed algorithms is shown to be at least O(log(log n)n(2)(log n)(2)). (C) 2018 Elsevier B.V. All rights reserved.