THE COMPLEXITY OF THE A BC PROBLEM.
Saved in:
| Title: | THE COMPLEXITY OF THE A BC PROBLEM. |
|---|---|
| Authors: | Jin-Yi Cai1 cai@cs.buffalo.edu, Lipton, Richard J.2 rjl@cs.princeton.edu, Yechezkel Zalcstein3 zzalcste@nsf.gov |
| Source: | SIAM Journal on Computing. 2000, Vol. 29 Issue 6, p1878. 11p. |
| Subjects: | Algorithms, Polynomials, Semigroups (Algebra), Group theory |
| Abstract: | We present a deterministic polynomial-time algorithm for the ABC problem, which is the membership problem for 2-generated commutative linear semigroups over an algebraic number field. We also obtain a polynomial-time algorithm for the (easier) membership problem for 2-generated abelian linear groups. Furthermore, we provide a polynomial-sized encoding for the set of all solutions. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
