摘要
A generalization of Gr(?)bner bases over ring (Z/(pe)[x1,…,xn])[I is given, where Z is the ring of integers, p is a prime, e≥1, and I is an ideal of Z/(pe)[x1,…,xn]. By applying this generalization, an algorithm is presented, which can synthesize multisequence with an equal or unequal length over Z[(m). The computational complexity of this algorithm is O(N2).
A generalization of Gr(?)bner bases over ring (Z/(pe)[x1,…,xn])[I is given, where Z is the ring of integers, p is a prime, e≥1, and I is an ideal of Z/(pe)[x1,…,xn]. By applying this generalization, an algorithm is presented, which can synthesize multisequence with an equal or unequal length over Z[(m). The computational complexity of this algorithm is O(N2).
基金
Project supported by the State Key Laboratory of Information Security
Graduate School of the Chinese Academy of Sciences
