메뉴 건너뛰기




Volumn 3, Issue 1, 1999, Pages 17-30

Reduction of the Three-Partition Problem

Author keywords

Combinatorial properties; Partition; Reduction

Indexed keywords


EID: 0012851340     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009856820553     Document Type: Article
Times cited : (7)

References (8)
  • 1
    • 0001302606 scopus 로고
    • Optimal scheduling of tasks on identical parallel processors
    • M. Dell'Amico and S. Martello "Optimal scheduling of tasks on identical parallel processors," ORSA Journal on Computing, vol. 7, pp. 191-200, 1995.
    • (1995) ORSA Journal on Computing , vol.7 , pp. 191-200
    • Dell'Amico, M.1    Martello, S.2
  • 2
    • 0001627504 scopus 로고
    • Complexity results for multiprocessors scheduling under resource constraints
    • M.R. Garey and D.S. Johnson, "Complexity results for multiprocessors scheduling under resource constraints," SIAM Journal on Computing, vol. 4, pp. 397-411, 1975.
    • (1975) SIAM Journal on Computing , vol.4 , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2
  • 4
    • 84976822151 scopus 로고
    • "Strong" NP-completeness results: Motivation, examples and implications
    • M.R. Garey and D.S. Johnson, "Strong" NP-completeness results: Motivation, examples and implications," Journal of ACM, vol. 25, pp. 499-508, 1978.
    • (1978) Journal of ACM , vol.25 , pp. 499-508
    • Garey, M.R.1    Johnson, D.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.