Verwandte Artikel zu Theory of Computational Complexity (Wiley Series in...

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) - Hardcover

 
9781118306086: Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Inhaltsangabe

Praise for the First Edition

"... complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity."
Zentralblatt MATH

A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.

Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as:

  • A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science
  • Additional exercises at varying levels of difficulty to further test comprehension of the presented material
  • End-of-chapter literature reviews that summarize each topic and offer additional sources for further study 

Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

DING-ZHU DU, PhD, is Professor in the Department of Computer Science at the University of Texas at Dallas. He has published over 180 journal articles in his areas of research interest, which include design and analysis of approximation algorithms for combinatorial optimization problems and communication networks. Dr. Du is also the coauthor of Problem Solving in Automata, Languages, and Complexity, also published by Wiley.

KER-I KO, PhD, is Professor in the Department of Computer Science at National Chiao Tung University, Taiwan. He has published extensively in his areas of research interest, which include computational complexity theory and its applications to numerical computation. Dr. Ko is also the coauthor of Problem Solving in Automata, Languages, and Complexity, also published by Wiley.

Von der hinteren Coverseite

Praise for the First Edition

"...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." -Zentralblatt MATH

A thorough revision based on advances in the field of computational complexity and readers’ feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.

Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as:

  • A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science
  • Additional exercises at varying levels of difficulty to further test comprehension of the presented material
  • End-of-chapter literature reviews that summarize each topic and offer additional sources for further study

Theory of Computational Complexity, Second Edition is an excellent textbook for courses on computational theory and complexity at the graduate-level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

Aus dem Klappentext

Praise for the First Edition

...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity. -Zentralblatt MATH

A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.

Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as:

  • A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science
  • Additional exercises at varying levels of difficulty to further test comprehension of the presented material
  • End-of-chapter literature reviews that summarize each topic and offer additional sources for further study

Theory of Computational Complexity, Second Edition is an excellent textbook for courses on computational theory and complexity at the graduate-level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

EUR 5,75 für den Versand von Vereinigtes Königreich nach Deutschland

Versandziele, Kosten & Dauer

Suchergebnisse für Theory of Computational Complexity (Wiley Series in...

Beispielbild für diese ISBN

Du, Ding-Zhu; Ko, Ker-I
Verlag: Wiley, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. In. Artikel-Nr. ria9781118306086_new

Verkäufer kontaktieren

Neu kaufen

EUR 121,37
Währung umrechnen
Versand: EUR 5,75
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

DZ Du
Verlag: John Wiley & Sons, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Gebunden. Zustand: New. DING-ZHU DU, PhD, is Professor in the Department of Computer Science at the University of Texas at Dallas. He has published over 180 journal articles in his areas of research interest, which include design and analysis of approximation algorithms for combin. Artikel-Nr. 447233049

Verkäufer kontaktieren

Neu kaufen

EUR 136,76
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Foto des Verkäufers

Ding-Zhu Du
Verlag: Wiley Jun 2014, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Buch. Zustand: Neu. Neuware. Artikel-Nr. 9781118306086

Verkäufer kontaktieren

Neu kaufen

EUR 143,77
Währung umrechnen
Versand: Gratis
Innerhalb Deutschlands
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Ko Ker?I Du Ding?Zhu Ko Ker-I Du Ding-Zhu
Verlag: John Wiley & Sons, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. pp. 512. Artikel-Nr. 96085649

Verkäufer kontaktieren

Neu kaufen

EUR 154,36
Währung umrechnen
Versand: EUR 10,21
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 3 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Du, Ding-Zhu/ Ko, Ker-I
Verlag: John Wiley & Sons Inc, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Hardcover. Zustand: Brand New. 2nd edition. 494 pages. 9.50x6.50x1.00 inches. In Stock. Artikel-Nr. x-1118306082

Verkäufer kontaktieren

Neu kaufen

EUR 182,04
Währung umrechnen
Versand: EUR 11,54
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Ding-Zhu Du
Verlag: Wiley, 2014
ISBN 10: 1118306082 ISBN 13: 9781118306086
Neu Hardcover

Anbieter: Kennys Bookstore, Olney, MD, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Providing the basic theory and methods that are essential for understanding complexity theory, this second edition of Theory of Computational Complexity emphasizes advances in the field of computational complexity, including newly developed algorithms and novel applications to quantum computing. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 512 pages, illustrations. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 241 x 157 x 33. Weight in Grams: 872. . 2014. 2nd Edition. Hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9781118306086

Verkäufer kontaktieren

Neu kaufen

EUR 196,02
Währung umrechnen
Versand: EUR 1,89
Von USA nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: Mehr als 20 verfügbar

In den Warenkorb