Please use this identifier to cite or link to this item:
Winker, Peter
Year of Publication: 
Series/Report no.: 
Diskussionsbeiträge - Serie II 184
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.
Document Type: 
Working Paper

Files in This Item:
782.02 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.