Mohlo by se vám také líbit

Více informací o knize Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 168 bodů

Anotace knihy

This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACMDoctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley.This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
• Autor: Madhu Sudan
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 94
• EAN: 9783540606154
• ISBN: 3540606157
• ID: 05274529
• Nakladatelství: Springer, Berlin
• Hmotnost: 201 g
• Rozměry: 234 × 156 × 5 mm
• Rok vydání: 1995

Oblíbené z jiného soudku

---

---

---