메뉴 건너뛰기




Volumn 4, Issue 3, 2001, Pages 222-229

System design is an NP-complete problem

Author keywords

[No Author keywords available]

Indexed keywords


EID: 1642295856     PISSN: 10981241     EISSN: None     Source Type: Journal    
DOI: 10.1002/sys.1018     Document Type: Article
Times cited : (33)

References (14)
  • 2
    • 0024303261 scopus 로고
    • The shortest network problem
    • January
    • M.W. Bern and R.L. Graham, The shortest network problem, Sci Am (January 1989), Vol. 260, no. 1, 84-89.
    • (1989) Sci Am , vol.260 , Issue.1 , pp. 84-89
    • Bern, M.W.1    Graham, R.L.2
  • 4
    • 0032121988 scopus 로고    scopus 로고
    • See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem
    • S.P. Coy, B.L. Golden, G.C. Runger, and E.A. Wasil, See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem, IEEE Trans Syst Man Cybernet Part A Syst Hum 28 (1998), 454-464.
    • (1998) IEEE Trans Syst Man Cybernet Part A Syst Hum , vol.28 , pp. 454-464
    • Coy, S.P.1    Golden, B.L.2    Runger, G.C.3    Wasil, E.A.4
  • 6
    • 84864894887 scopus 로고    scopus 로고
    • K. Gödel, Kurt Gödel, Collected works, S. Feferman (Editor), Oxford University Press, Oxford, 1990
    • K. Gödel, Kurt Gödel, Collected works, S. Feferman (Editor), Oxford University Press, Oxford, 1990.
  • 7
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R.E. Miller and J.W. Thatcher (Editors), Plenum, New York
    • R.M. Karp, "Reducibility among combinatorial problems," Complexity of computer computations, R.E. Miller and J.W. Thatcher (Editors), Plenum, New York, 1972, pp. 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 12
    • 0001602510 scopus 로고
    • On computable numbers with an application to the Entscheidungsproblem
    • ["Correction," Proc London Math Soc, XLIII, 1937, pp. 544-546]
    • A. Turing, On computable numbers with an application to the Entscheidungsproblem, Proc London Math Soc, XLII, 1936, pp. 239-265 ["Correction," Proc London Math Soc, XLIII, 1937, pp. 544-546].
    • (1936) Proc London Math Soc , vol.42 , pp. 239-265
    • Turing, A.1
  • 14
    • 23744449157 scopus 로고    scopus 로고
    • When can we safely reuse systems, upgrade systems or use COTS components?
    • A.W. Wymore and A.T. Bahill, When can we safely reuse systems, upgrade systems or use COTS components? Syst Eng 3(2) (2000), pp. 82-95.
    • (2000) Syst Eng , vol.3 , Issue.2 , pp. 82-95
    • Wymore, A.W.1    Bahill, A.T.2


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