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...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.展开更多
基金Supported by the National Natural Science Foundation of China(11775208)Education and Sci-Tech Projects for Young and Middle-aged Teachers in Fujian Province(JK2014053)Educational Research Projects for Young and Middle-aged Teachers in Fujian Province(JAT170582)
基金supported by the National Key Basic Research Project of China (Grant No. 2004CB318001)
文摘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.