Algorithmic Complexity and Telecommunication Problems

Algorithmic Complexity and Telecommunication Problems

by Barthelmy, J-P

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Algorithmic Complexity and Telecommunication Problems / J-P Barthelmy, G. Cohen, A Lobstein.

Edition Statements

  • Publication Date:2020.
  • Edition:1st

Publication Statements

  • Publisher(s):CRC Press
  • Language:eng
  • Publication Date:2020.

The Physical Object

  • Description:1 online resource (276 pages)

Edition Identifiers

  • ISBN:9781000159431, 1000159434, 9781003076704, 100307670X
  • DOI:10.1201/9781003076704.
  • oclc:on1203557891
  • LC Classification:QA267.7.B3713 1996
  • Dewey Decimal:003/.54/015113

Table of Contents

Problems and languages; machines, languages and problems -- classes P and NP; NP-hard problems and languages; complexity and coding; complexity and cryptology; vector quantization.

Read More ↓

Subjects

Algorithmes ALGORITHMS Algorithmus -- Komplexität Complexité de calcul (Informatique) Computational complexity Informationstheorie -- Komplexität Komplexität -- Algorithmus Komplexität -- Informationstheorie NP-complete problems Problèmes NP-complets

Writers

Barthelmy, J-P Cohen, G. Lobstein, A

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

No downloadable files are registered for this work yet.

Log in to request a copy