Search Results       Your search for [subject]NP-complete problems returned 1 record.           Efficient checking of polynomials and proofs and the hardness of approximation problems. by Sudan, Madhu; Berlin: Springer-Verlag, 1995. Subject: Automatic theorem proving; Computational complexity; NP-complete problems.          Add to Book Cart Relevance: 25.58%