Working paper/research report

Authors list: Winker, Peter

Publication year: 1992

URL: http://hdl.handle.net/10419/101461

Title of series: Diskussionsbeiträge, Sonderforschungsbereich 178 Internationalisierung der Wirtschaft : Serie 2

Number in series: 184

Abstract: 

A combinatorical problem is said to be of high computational complexity, if it can be shown that every efficient algorithm needs a high amount of resources as measured in Computing time or storage capacity. This paper will (1) introduce some basic concepts of mathematical complexity theory; (2) show that the problem of Optimal Aggregation is of high computational complexity; and (3) outline a possible way to obtain results good enough for practical use despite of this high computational complexity.

Harvard Citation style: Winker, P. (1992) Some notes on the computational complexity of optimal aggregation. (Diskussionsbeiträge, Sonderforschungsbereich 178 Internationalisierung der Wirtschaft : Serie 2, 184). Konstanz: Sonderforschungsbereich 178. http://hdl.handle.net/10419/101461

APA Citation style: Winker, P. (1992). Some notes on the computational complexity of optimal aggregation. (Diskussionsbeiträge, Sonderforschungsbereich 178 Internationalisierung der Wirtschaft : Serie 2, 184). Sonderforschungsbereich 178. http://hdl.handle.net/10419/101461