Arbeitspapier
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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Diskussionsbeiträge - Serie II ; No. 184
- Klassifikation
-
Wirtschaft
- Thema
-
Aggregation
Mathematische Optimierung
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Winker, Peter
- Ereignis
-
Veröffentlichung
- (wer)
-
Universität Konstanz, Sonderforschungsbereich 178 - Internationalisierung der Wirtschaft
- (wo)
-
Konstanz
- (wann)
-
1992
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Winker, Peter
- Universität Konstanz, Sonderforschungsbereich 178 - Internationalisierung der Wirtschaft
Entstanden
- 1992
Ähnliche Objekte (12)
Computational complexity
Kolmogorov complexity and computational complexity
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Complexity bounds on some fundamental computational problems for quantum branching programs
On the computational complexity of temporal projection and some related problems
Complexity bounds on some fundamental computational problems for quantum branching programs
Computational complexity of graph polynomials
Computational Steering with Reduced Complexity
Computational steering with reduced complexity
On the complexity of some basic problems in computational convexity, 1.. Containment problems
A note on the computational complexity of some problems for self-verifying finite automata
Aspects of complexity : minicourses in algorithmics, complexity and computational algebra
Computational complexity
Kolmogorov complexity and computational complexity
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Complexity bounds on some fundamental computational problems for quantum branching programs
On the computational complexity of temporal projection and some related problems
Complexity bounds on some fundamental computational problems for quantum branching programs
Computational complexity of graph polynomials
Computational Steering with Reduced Complexity
Computational steering with reduced complexity
On the complexity of some basic problems in computational convexity, 1.. Containment problems
A note on the computational complexity of some problems for self-verifying finite automata
Aspects of complexity : minicourses in algorithmics, complexity and computational algebra
Computational complexity
Kolmogorov complexity and computational complexity
Computational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
Complexity bounds on some fundamental computational problems for quantum branching programs
On the computational complexity of temporal projection and some related problems
Complexity bounds on some fundamental computational problems for quantum branching programs
Computational complexity of graph polynomials
Computational Steering with Reduced Complexity
Computational steering with reduced complexity
On the complexity of some basic problems in computational convexity, 1.. Containment problems
A note on the computational complexity of some problems for self-verifying finite automata