Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3150518 obálek a 950589 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Efficient checking of polynomials and proofs and the hardness of approximation problems
Autor: Sudan, Madhu
Rok: 1995
ISBN: 9783540606154
OKCZID: 110103752
Citace (dle ČSN ISO 690):
SUDAN, Madhu. Efficient checking of polynomials and proofs and the hardness of approximation problems. Berlin: Springer-Verlag, 1995. XIV, 87 s. Lecture notes in computer science, 1001.
Anotace
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral 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.