Algorithmic Complexity and Telecommunication Problems

Klappentext In this advanced text on algorithmic complexity! the authors explore an area fundamental to the study of theoretical computer science! with special attention paid to problems arising in computer communication. Zusammenfassung In this advanced text on algorithmic complexity, the authors explore an area fundamental to the study of theoretical computer science, with special attention paid to problems arising in computer communication. Inhaltsverzeichnis Problems and languages; machines! languages and problems - classes P and NP; NP-hard problems and languages; complexity and coding; complexity and cryptology; vector quantization.

Product details

• Authors: J. P. Barthelemy, J.-P. Barthelemy, J.-P. (Head of Department of Artificia Barthelemy, J.-P. Cohen Barthelemy, Jean-Pierre Barthelemy, Jean-Pierre Etc. Cohen Barthelemy, BARTHELEMY JEAN PIERRE ETC COHEN, J-P Barthelmy, J-P Cohen Barthelmy, G. Cohen, Cohen G, Cohen G., A Lobstein, A. Lobstein, Antoine Lobstein
• Assisted by: J.-P. Barthelemy (Translation), G. Cohen (Translation), Catherine Fritsch-Mignotte (Translation), Maurice Mignotte (Translation)
• Publisher: Taylor & Francis Ltd.
• Languages: English
• Product format: Hardback
• Released: 14.01.1997
• EAN: 9781857284515
• ISBN: 978-1-85728-451-5
• No. of pages: 276
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics