Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems
Sudan, Madhu.
Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems edited by Madhu Sudan. - On-campus e-Book by Springer under Digital Library Program of Higher Education Commission (HEC) of Pakistan
9783540484851
Computer 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.
Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems edited by Madhu Sudan. - On-campus e-Book by Springer under Digital Library Program of Higher Education Commission (HEC) of Pakistan
9783540484851
Computer 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.