Some notes on the computational complexity of optimal aggregation
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.
Year of publication: |
1992
|
---|---|
Authors: | Winker, Peter |
Institutions: | Fachbereich Wirtschaftswissenschaften, Universität Konstanz |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Franz, Wolfgang, (1993)
-
Identification of multivariate AR-models by threshold accepting
Winker, Peter, (1994)
-
Application of threshold accepting to the evaluation of the discrepancy of a set of points
Winker, Peter, (1995)
- More ...