Complexity of problems and algorithms
- 122 Downloads
Complexity theory proposes a set of results and methods to evaluate the intrinsic complexity of the problems. A problem belongs to a class of complexity, which informs us of the complexity of the “best algorithm” able to solve it. Complexity theory brings our attention to decision problems, and is based on languages theory and Turing machines. The reader interested in a very detailed presentation of complexity theory is referred to [Garey and Johnson, 1979] or [Papadimitriou, 1995].
KeywordsSchedule Problem Polynomial Time Decision Problem Turing Machine Complexity Theory
Unable to display preview. Download preview PDF.