Can I read Algorithmic Complexity and Telecommunication Problems on EtoBox?

Algorithmic Complexity and Telecommunication Problems by Barthelemy, Jean-Pierre; Cohen, Gérard; Lobstein, Antoine is a nonfiction available to read on EtoBox.

What is Algorithmic Complexity and Telecommunication Problems about?

Problems and languages; machines, languages and problems - classes P and NP; NP-hard problems and languages; complexity and coding; complexity and cryptology; vector quantization.;In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting deman

Who reads Algorithmic Complexity and Telecommunication Problems?

Author

Barthelemy, Jean-Pierre; Cohen, Gérard; Lobstein, Antoine

Publisher

Taylor & Francis Group

Published

2003

Language

EN

ISBN

9781000159431

Category

nonfiction

Subjects

Computer Science, Engineering, Technology