Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Angličtina
118 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Pevná
9 588
Kč
/
Brožovaná
641
Kč
/
Audio CD
365
Kč
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.
Informace o knize
Angličtina
Kategorie
