Non ti piace? Non importa! Puoi restituircelo entro 30 giorni
Non puoi sbagliarti con un buono regalo. Con il buono regalo, il destinatario può scegliere qualsiasi prodotto della nostra offerta.
30 giorni per il reso
This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language. In doing so, the reader is introduced to new classes of algorithms which may be analysed more precisely than hereto. The authors have made the book as self-contained as possible and a lot of background material is included. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest in this book.
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?