Some notes on the computational complexity of optimal aggregation

Peter Winker

No 184, Discussion Papers, Series II from University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy"

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.

Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/101461/1/756468035.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:kondp2:184

Access Statistics for this paper

More papers in Discussion Papers, Series II from University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy" Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().