System design problem is NP-complete

William L. Chapman, Jerzy W Rozenblit, A. Terry Bahill

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

System design is the process used to transfer the need for a system into an actual production unit. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete. This will be done by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The implications of this are that designing optimal systems with deterministic, polynomial time procedures is not possible. However, designing near optimal systems is possible and even likely.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
PublisherIEEE
Pages1880-1884
Number of pages5
Volume2
StatePublished - 1994
Externally publishedYes
EventProceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3) - San Antonio, TX, USA
Duration: Oct 2 1994Oct 5 1994

Other

OtherProceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3)
CitySan Antonio, TX, USA
Period10/2/9410/5/94

Fingerprint

Computational complexity
Optimal systems
Systems analysis
Polynomials
Costs

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Chapman, W. L., Rozenblit, J. W., & Bahill, A. T. (1994). System design problem is NP-complete. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (Vol. 2, pp. 1880-1884). IEEE.

System design problem is NP-complete. / Chapman, William L.; Rozenblit, Jerzy W; Bahill, A. Terry.

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 2 IEEE, 1994. p. 1880-1884.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chapman, WL, Rozenblit, JW & Bahill, AT 1994, System design problem is NP-complete. in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. vol. 2, IEEE, pp. 1880-1884, Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3), San Antonio, TX, USA, 10/2/94.
Chapman WL, Rozenblit JW, Bahill AT. System design problem is NP-complete. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 2. IEEE. 1994. p. 1880-1884
Chapman, William L. ; Rozenblit, Jerzy W ; Bahill, A. Terry. / System design problem is NP-complete. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 2 IEEE, 1994. pp. 1880-1884
@inproceedings{554cfd83311349bc9bc69695bb553bcc,
title = "System design problem is NP-complete",
abstract = "System design is the process used to transfer the need for a system into an actual production unit. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete. This will be done by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The implications of this are that designing optimal systems with deterministic, polynomial time procedures is not possible. However, designing near optimal systems is possible and even likely.",
author = "Chapman, {William L.} and Rozenblit, {Jerzy W} and Bahill, {A. Terry}",
year = "1994",
language = "English (US)",
volume = "2",
pages = "1880--1884",
booktitle = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
publisher = "IEEE",

}

TY - GEN

T1 - System design problem is NP-complete

AU - Chapman, William L.

AU - Rozenblit, Jerzy W

AU - Bahill, A. Terry

PY - 1994

Y1 - 1994

N2 - System design is the process used to transfer the need for a system into an actual production unit. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete. This will be done by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The implications of this are that designing optimal systems with deterministic, polynomial time procedures is not possible. However, designing near optimal systems is possible and even likely.

AB - System design is the process used to transfer the need for a system into an actual production unit. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete. This will be done by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The implications of this are that designing optimal systems with deterministic, polynomial time procedures is not possible. However, designing near optimal systems is possible and even likely.

UR - http://www.scopus.com/inward/record.url?scp=0028731780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028731780&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 1880

EP - 1884

BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

PB - IEEE

ER -