Testing Equalities of Multiplicative Representations in Polynomial Time (Extended Abstract)
Guoqiang Ge · Foundations of Computer Science · 1993
kFor multiplicative representations ni=, ay' and n;=, Byi , where ai, pj are non-zero elements of some algebraic number field K and ni, mj are rational integers, we present a deterministic polynomial time algorithm that decides whether HfZl ay' equals l$=, py'. The running time of the algorithm is polynomial in the number of bits required to represent the number field K, the elements ai,pj and the integers ni, mj.