JCP 2019 Vol.14(1): 79-87 ISSN: 1796-203X
doi: 10.17706/jcp.14.1.79-87
doi: 10.17706/jcp.14.1.79-87
Hazem M Bahig1,3, Yasser Kotb2,3
1College of Computer Science and Engineering, Hail University, Hail, KSA.
2College of Computer and Information Sciences, Information Systems Department, Al Imam Mohammad ibn Saud Islamic University, Riyadh, KSA.
3Computer Science Division, Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt.
Abstract—This paper addresses one of the NP-complete problems that is used to reduce the number of computation for multi-exponentiation operation. The problem is the addition sequence for a set of n-positive integers X = {m1, m2, . . . , mn} such that 2≤ mi < mi+1, 1≤i
Index Terms—Addition sequence, parallel algorithm, multicore, NP-complete, branch and bound, breadth search.
2College of Computer and Information Sciences, Information Systems Department, Al Imam Mohammad ibn Saud Islamic University, Riyadh, KSA.
3Computer Science Division, Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt.
Abstract—This paper addresses one of the NP-complete problems that is used to reduce the number of computation for multi-exponentiation operation. The problem is the addition sequence for a set of n-positive integers X = {m1, m2, . . . , mn} such that 2≤ mi < mi+1, 1≤i
Index Terms—Addition sequence, parallel algorithm, multicore, NP-complete, branch and bound, breadth search.
Cite: Hazem M Bahig, Yasser Kotb, "A Multicore Exact Algorithm for Addition Sequence," Journal of Computers vol. 14, no. 1, pp. 79-87, 2019.
NEXT PAPER
Last page
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>