### 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 language | English (US) |
---|---|

Title of host publication | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |

Publisher | IEEE |

Pages | 1880-1884 |

Number of pages | 5 |

Volume | 2 |

State | Published - 1994 |

Externally published | Yes |

Event | Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3) - San Antonio, TX, USA Duration: Oct 2 1994 → Oct 5 1994 |

### Other

Other | Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3) |
---|---|

City | San Antonio, TX, USA |

Period | 10/2/94 → 10/5/94 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Control and Systems Engineering

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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.

}

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 -