### Abstract

The system design problem describes the process used to translating the need or requirements for a system into an actual design. 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 by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The results indicate that designing optimal systems with deterministic, polynomial time procedures is not possible.

Original language | English (US) |
---|---|

Pages | 51-57 |

Number of pages | 7 |

State | Published - Jan 1 1995 |

Event | Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems - Tucson, AZ, USA Duration: Mar 6 1995 → Mar 9 1995 |

### Other

Other | Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems |
---|---|

City | Tucson, AZ, USA |

Period | 3/6/95 → 3/9/95 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Complexity of the system design problem*. 51-57. Paper presented at Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems, Tucson, AZ, USA, .