By Topic

Testing equalities of multiplicative representations in polynomial time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Guoqiang Ge ; Dept. of Math., California Univ., Berkeley, CA, USA

For multiplicative representations Πi=1kαin(i) and Πj=1lβjm(j) where αi, βj 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 Πi=1kαin(i) equals Πj=1lβjm(j). The running time of the algorithm is polynomial in the number of bits required to represent the number field K, the elements αi , βj and the integers ni, mj

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993