Efficient checking of polynomials and proofs and the hardness of approximation problems
Auteur :
Sudan, Madhu
ISBN :
9783540606154
Date de publication :
13 déc. 1995
Dimensions :
23,4 x 15,6 x 0,5 cm
Poids :
164 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Allemagne
Building on results in theoretical computer science, this work offers theoretical insights and advances in applicable techniques in such areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algoritms, and NP-complete optimization.