Barthélemy, J.-P.; Cohen, G.; Lobstein, A. Algorithmic complexity and communication problems. (Complexité algorithmique et problèmes de communications. Préface de M. Minoux.) (French) Zbl 0765.68005 Collection Technique et Scientifique des Télécommunications. Paris etc.: Masson. XXVII, 228 p. (1992). The book represents a clear, synthetical and deep presentation of the problem P =? NP. It contains six chapters (Problems and languages, Classes P and NP, NP-hard problems, Complexity and coding, Complexity and cryptology, Vector optimization). It is a serious, updated rival of the famous Garey-Johnson ’79 book. As in most cases in the history of mathematics, the challenging open problem P =? NP generates a lot of other problems, often interesting in themselves. Reviewer: C.Calude (Auckland) Cited in 12 Documents MSC: 68-02 Research exposition (monographs, survey articles) pertaining to computer science 68Q25 Analysis of algorithms and problem complexity 94-02 Research exposition (monographs, survey articles) pertaining to information and communication theory Keywords:classes P and NP; NP-hard problems; complexity; coding; complexity and cryptology PDFBibTeX XMLCite \textit{J. P. Barthélemy} et al., Complexité algorithmique et problèmes de communications. Préface de M. Minoux. Paris etc.: Masson (1992; Zbl 0765.68005)