Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/149837
Authors: 
Schirmer, Andreas
Year of Publication: 
1995
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 381
Abstract: 
It is a well-known fact that there exists an ever increasing number of problems for which, despite the efforts of many inventive and persistent researchers, it seems virtually impossible to find efficient algorithms. In this Situation, the theory of computational complexity may provide helpful insight into how probable the existence of such algorithms is at all. Unluckily, some of its concepts can still be found to be used erroneously, if at all. For instance, it is a common misunderstanding that any problem that generalizes an NP-complete problem is NP-complete or NP-hard itself; indeed any such generalization could as well be exponential in the worst case, i.e. solvable with effort exponentially increasing in the size of the instances attempted. In this work we develop the basic concepts of complexity theory. While doing so, we aim at presenting the material in a way that emphasizes the correspondences between the kind of problems considered in Operations research and the formal problem classes which are studied in complexity theory.
Subjects: 
Complexity Theory
Optimization Problems
NP-Complete
NP-Hard
NP-Easy
NP-Equivalent
Document Type: 
Working Paper

Files in This Item:
File
Size





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