This is an introduction to the the theory of computational complexity, whose birth can be set in the early 1960s when the first users of electronic computers started to pay increasing attention to the performances of their programs. Since these preliminary stages, many more results have been obtained and, as stated by Hartmanis in 1989, "the systematic study of computational complexity theory has developed into one of the central and most active research areas of computer science".
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY / D.P. BOVET; P. CRESCENZI. - STAMPA. - (1987), pp. 102-111. (Intervento presentato al convegno MEASURES OF COMPLEXITY).
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY
CRESCENZI, PIERLUIGI
1987
Abstract
This is an introduction to the the theory of computational complexity, whose birth can be set in the early 1960s when the first users of electronic computers started to pay increasing attention to the performances of their programs. Since these preliminary stages, many more results have been obtained and, as stated by Hartmanis in 1989, "the systematic study of computational complexity theory has developed into one of the central and most active research areas of computer science".
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
