000 00887nam a2200145Ia 4500
008 140211s9999 xx 000 0 und d
020 _a9783540484851
100 _aSudan, Madhu.
245 _aEfficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems
245 _cedited by Madhu Sudan.
300 _aOn-campus e-Book by Springer under Digital Library Program of Higher Education Commission (HEC) of Pakistan
650 _aComputer science.; Software engineering.; Coding theory.; Computer software.; Logic design.; Numerical analysis.; Computer Science.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Coding and Information Theory.; Numerical Analysis.
856 4 1 _3Click her to access the e-Book
_uhttp://dx.doi.org/10.1007/3-540-60615-7
942 _cEB
999 _c114604
_d114604