Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems