최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기The journal of the institute of internet, broadcasting and communication : JIIBC, v.22 no.4, 2022년, pp.95 - 102
This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min value...
S. J. C. Joosten, "Relaxations of the 3-Partition Problem," Department of Applied Mathematics, University of Twente, pp. 1-41, Dec. 2011,
J. Li and H. Ding, "Approximation Schemes for the 3-Partitioning Problems," Communications and Networks, Vol. 2013, No. 5, pp. 90-95, Feb. 2013, https://doi.org/10.4236/cn.2013.51B021
T. Panahi, T. Heidari, and V. S. Naeini, "An Efficient Parallel Algorithm for Solving the 3-Partition Problem Based on ADI," International Journal of Recent Technology and Engineering, Vol. 2, No. 1, pp. 94-98, Mar. 2013.
G. P. K. Ang, "Possibility of Proving PNP Through 3-Partition Problems," Dec. 2021.
Codechef, "Three Partition Problem Using Dynamic Programming," https://discuss.codechef.com/t/three-partition-problem-using-dynamic-programming/72378, Jul. 2020.
R. Jain and N. S. Chaudhari, "A New Bit Wise Technique for 3-Partitioning Algorithm," Ijca Special Issue of International Journal of Computer Applications on Optimization and On-Chip Communication, No. 1, pp. 1-5, Feb. 2012
Wikipedia, "3-Partition Problem," https://en.wikipedia.org/wiki/3-partition_problem, Retrieved Feb. 2022.
R. E. Ladner, "CSE 589 Applied Algorithms 3-Colorability 3-CNF-Sat
Techiedelight, "3-Partition Problem," https://www.techiedelight.com/3-partition-problem, Retrieved Feb. 2022.
Techiedelight, "3-Partition Problem Extended," https://www.techiedelight.com/3-partition-problem-extended-print-all-partitions, Retrieved Feb. 2022.
Stackoverflow, "3-Partition Problem," https://stackoverflow.com/questions/4803668/3-partition-problem, Retrieved Feb. 2022.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.