NP复杂度类问题 The complexity class NP is the class of languages that can be verified by a poly- nomial-time algorithm.8 More precisely,a language L belongs to NP if and only if there exist a two-input polynomial-time algorithm A and a constant c such that L=x0,1*:there exists a certificate y with ly=(x) such that A(x,y)=1. We say that algorithm A verifies language L in polynomial time. 问题68这里的vcf9和⑧前面的vcf9,有什么区J?NP复杂度类问题 问题6：这里的verify和前面的verify，有什么区别？