期刊名称:Journal of Information and Organizational Sciences
印刷版ISSN:1846-3312
电子版ISSN:1846-9418
出版年度:1997
卷号:21
期号:1
页码:27-41
出版社:Faculty of Organization and Informatics University of Zagreb
摘要:While developing larger information systems, it is necessary to decompose them into subsystems for the purpose of easier designing. The intention is, for decomposition to be performed in a way that results in as small losses in system quality as possible. Consequently, there is, a need for defining the system decomposition quality parameters. Once the parameters are defined, the obvious question arises of an optimal system decomposition under particular conditions as well as of its time complexity. The respective research shows that the system decomposing algorithm should, in the worst case, be of exponential time complexity, the task belonging to the class of the NP-complete tasks.
关键词:algorithm; complexity; process; information system design