摘要
This paper investigates complex brackets and balanced complex 1st-order difference (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.
This paper investigates complex brackets and balanced complex 1st-order di?erence (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.
基金
supported by the National Key Basic Research Project of China (Grant No. 2004CB318001)