The Complexity of Generating and Checking Proffs of Membership

We consider the following questions Can one compute satisfying assignments for sat is able Boolean formulas in polynomial time with parallel queries to NP Is the unique optimal clique problem UOCLIQUE complete for P O logn Is the unique satis a bility problem USAT NP hard We investigate the complexity of generating proofs of membership for sets in NP and P… CONTINUE READING